./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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_70-funloop_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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-19 03:35:47,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 03:35:47,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 03:35:47,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 03:35:47,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 03:35:47,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 03:35:47,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 03:35:47,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 03:35:47,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 03:35:47,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 03:35:47,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 03:35:47,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 03:35:47,794 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 03:35:47,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 03:35:47,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 03:35:47,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 03:35:47,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 03:35:47,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 03:35:47,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 03:35:47,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 03:35:47,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 03:35:47,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 03:35:47,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 03:35:47,801 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 03:35:47,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 03:35:47,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 03:35:47,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 03:35:47,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 03:35:47,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 03:35:47,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 03:35:47,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 03:35:47,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 03:35:47,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 03:35:47,803 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 03:35:47,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 03:35:47,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 03:35:47,804 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 03:35:47,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 03:35:47,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 03:35:47,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 03:35:47,805 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 03:35:47,805 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 03:35:48,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 03:35:48,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 03:35:48,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 03:35:48,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 03:35:48,029 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 03:35:48,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-19 03:35:49,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 03:35:49,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 03:35:49,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2024-10-19 03:35:49,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cff60e8c/d31451bbf7aa412a9c6b99487449fdf2/FLAG838876177 [2024-10-19 03:35:49,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2cff60e8c/d31451bbf7aa412a9c6b99487449fdf2 [2024-10-19 03:35:49,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 03:35:49,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 03:35:49,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 03:35:49,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 03:35:49,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 03:35:49,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 03:35:49" (1/1) ... [2024-10-19 03:35:49,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3e25c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:49, skipping insertion in model container [2024-10-19 03:35:49,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 03:35:49" (1/1) ... [2024-10-19 03:35:49,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 03:35:49,964 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_70-funloop_racefree.i[41323,41336] [2024-10-19 03:35:49,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 03:35:49,994 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 03:35:50,033 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_70-funloop_racefree.i[41323,41336] [2024-10-19 03:35:50,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 03:35:50,128 INFO L204 MainTranslator]: Completed translation [2024-10-19 03:35:50,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50 WrapperNode [2024-10-19 03:35:50,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 03:35:50,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 03:35:50,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 03:35:50,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 03:35:50,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,201 INFO L138 Inliner]: procedures = 272, calls = 35, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 218 [2024-10-19 03:35:50,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 03:35:50,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 03:35:50,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 03:35:50,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 03:35:50,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 03:35:50,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 03:35:50,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 03:35:50,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 03:35:50,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (1/1) ... [2024-10-19 03:35:50,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 03:35:50,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:35:50,282 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-19 03:35:50,293 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-19 03:35:50,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-19 03:35:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-19 03:35:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-19 03:35:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 03:35:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 03:35:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-19 03:35:50,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 03:35:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-19 03:35:50,325 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-19 03:35:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 03:35:50,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 03:35:50,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 03:35:50,326 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 03:35:50,432 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 03:35:50,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 03:35:50,648 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 03:35:50,648 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 03:35:50,760 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 03:35:50,760 INFO L314 CfgBuilder]: Removed 25 assume(true) statements. [2024-10-19 03:35:50,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 03:35:50 BoogieIcfgContainer [2024-10-19 03:35:50,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 03:35:50,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 03:35:50,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 03:35:50,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 03:35:50,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 03:35:49" (1/3) ... [2024-10-19 03:35:50,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33981831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 03:35:50, skipping insertion in model container [2024-10-19 03:35:50,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 03:35:50" (2/3) ... [2024-10-19 03:35:50,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33981831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 03:35:50, skipping insertion in model container [2024-10-19 03:35:50,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 03:35:50" (3/3) ... [2024-10-19 03:35:50,769 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2024-10-19 03:35:50,785 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 03:35:50,786 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-19 03:35:50,788 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 03:35:50,832 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-19 03:35:50,878 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 03:35:50,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 03:35:50,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:35:50,881 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-19 03:35:50,884 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-19 03:35:50,972 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 03:35:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:35:50,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-19 03:35:50,993 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;@337f016f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 03:35:50,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-19 03:35:51,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:35:51,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:35:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1853550032, now seen corresponding path program 1 times [2024-10-19 03:35:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:35:51,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430329219] [2024-10-19 03:35:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:35:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:35:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:35:51,715 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-19 03:35:51,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:35:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430329219] [2024-10-19 03:35:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430329219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 03:35:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 03:35:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 03:35:51,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994744516] [2024-10-19 03:35:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 03:35:51,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 03:35:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:35:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 03:35:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 03:35:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:35:51,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:35:51,740 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-19 03:35:51,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:35:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:35:51,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 03:35:51,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:35:51,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:35:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1805902569, now seen corresponding path program 1 times [2024-10-19 03:35:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:35:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445640834] [2024-10-19 03:35:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:35:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:35:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:35:51,909 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-19 03:35:51,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:35:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445640834] [2024-10-19 03:35:51,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445640834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:35:51,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111465950] [2024-10-19 03:35:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:35:51,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:35:51,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:35:51,916 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-19 03:35:51,923 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-19 03:35:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:35:52,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-19 03:35:52,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:35:52,018 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-19 03:35:52,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:35:52,034 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-19 03:35:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111465950] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:35:52,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:35:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-19 03:35:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396895750] [2024-10-19 03:35:52,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:35:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-19 03:35:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:35:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-19 03:35:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-19 03:35:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:35:52,038 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:35:52,038 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-19 03:35:52,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:35:52,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:35:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:35:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:35:52,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-19 03:35:52,297 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-19 03:35:52,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:35:52,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:35:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash -342103024, now seen corresponding path program 2 times [2024-10-19 03:35:52,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:35:52,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559483429] [2024-10-19 03:35:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:35:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:35:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:35:52,426 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-19 03:35:52,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:35:52,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559483429] [2024-10-19 03:35:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559483429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:35:52,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948515906] [2024-10-19 03:35:52,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 03:35:52,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:35:52,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:35:52,429 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-19 03:35:52,430 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-19 03:35:52,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 03:35:52,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 03:35:52,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-19 03:35:52,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:35:52,519 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-19 03:35:52,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:35:52,562 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-19 03:35:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948515906] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:35:52,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:35:52,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-19 03:35:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068919030] [2024-10-19 03:35:52,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:35:52,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-19 03:35:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:35:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-19 03:35:52,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-19 03:35:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:35:52,565 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:35:52,565 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-19 03:35:52,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:35:52,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:35:52,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:35:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:35:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:35:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:35:52,626 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-19 03:35:52,817 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-19 03:35:52,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:35:52,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:35:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1712501392, now seen corresponding path program 3 times [2024-10-19 03:35:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:35:52,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375956312] [2024-10-19 03:35:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:35:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:35:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:35:53,050 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-19 03:35:53,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:35:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375956312] [2024-10-19 03:35:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375956312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:35:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400039917] [2024-10-19 03:35:53,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 03:35:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:35:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:35:53,054 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-19 03:35:53,055 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-19 03:35:53,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-19 03:35:53,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 03:35:53,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-19 03:35:53,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:35:53,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-19 03:35:53,217 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:35:53,217 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-19 03:35:53,234 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-19 03:35:53,288 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-19 03:35:53,317 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-19 03:35:53,334 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-19 03:35:53,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:36:01,398 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-19 03:36:01,413 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-19 03:36:01,520 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-19 03:36:01,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400039917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:36:01,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:36:01,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-19 03:36:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967577022] [2024-10-19 03:36:01,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:36:01,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-19 03:36:01,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:36:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-19 03:36:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-19 03:36:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:36:01,524 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:36:01,525 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-19 03:36:01,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:36:01,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:36:01,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:36:01,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:36:01,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:36:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:36:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:36:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:36:01,726 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-19 03:36:01,912 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-19 03:36:01,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:36:01,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:36:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2049452556, now seen corresponding path program 1 times [2024-10-19 03:36:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:36:01,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020756707] [2024-10-19 03:36:01,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:36:01,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:36:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:36:02,531 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-19 03:36:02,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:36:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020756707] [2024-10-19 03:36:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020756707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:36:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191163870] [2024-10-19 03:36:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:36:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:36:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:36:02,536 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-19 03:36:02,538 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-19 03:36:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:36:02,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-19 03:36:02,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:36:02,648 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-19 03:36:02,702 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:36:02,703 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-19 03:36:02,721 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-19 03:36:02,806 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-19 03:36:02,857 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-19 03:36:02,914 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-19 03:36:03,015 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-19 03:36:03,034 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-19 03:36:03,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:36:11,129 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-19 03:36:17,184 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-19 03:36:17,304 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-19 03:36:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191163870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:36:17,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:36:17,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-19 03:36:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570333713] [2024-10-19 03:36:17,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:36:17,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-19 03:36:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:36:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-19 03:36:17,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=326, Unknown=4, NotChecked=78, Total=506 [2024-10-19 03:36:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:36:17,307 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:36:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 03:36:17,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:36:17,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:36:17,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:36:17,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:36:17,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:36:19,332 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:36:19,333 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 29 treesize of output 25 [2024-10-19 03:36:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1610656066, now seen corresponding path program 1 times [2024-10-19 03:36:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:36:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:36:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:36:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-19 03:36:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:36:19,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:36:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:36:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-19 03:36:19,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-19 03:36:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-19 03:36:19,761 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:36:19,761 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 1276 treesize of output 1136 [2024-10-19 03:36:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2003208492, now seen corresponding path program 1 times [2024-10-19 03:36:19,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:36:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:36:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:36:19,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:36:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:36:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:36:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:36:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:36:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 03:36:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-19 03:36:20,000 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-19 03:36:20,184 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,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-19 03:36:20,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:36:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:36:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1652070412, now seen corresponding path program 2 times [2024-10-19 03:36:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:36:20,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394831847] [2024-10-19 03:36:20,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:36:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:36:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:36:21,481 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-19 03:36:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:36:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394831847] [2024-10-19 03:36:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394831847] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:36:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112677267] [2024-10-19 03:36:21,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 03:36:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:36:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:36:21,484 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-19 03:36:21,487 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-19 03:36:21,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 03:36:21,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 03:36:21,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-19 03:36:21,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:36:21,590 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-19 03:36:21,682 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:36:21,683 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-19 03:36:21,736 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-19 03:36:21,871 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-19 03:36:21,966 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-19 03:36:22,006 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-19 03:36:24,536 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-19 03:36:24,567 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-19 03:36:24,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:36:42,475 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:36:44,125 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:36:45,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:36:48,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_536 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_536 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:36:50,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_536 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_536 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-10-19 03:36:52,082 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_534 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_536 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (= (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_534) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_536 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_538) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-10-19 03:36:52,281 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-19 03:36:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112677267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:36:52,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:36:52,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 30 [2024-10-19 03:36:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251671261] [2024-10-19 03:36:52,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:36:52,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-19 03:36:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:36:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-19 03:36:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=506, Unknown=17, NotChecked=306, Total=930 [2024-10-19 03:36:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:36:52,283 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:36:52,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.4193548387096775) internal successors, (106), 30 states have internal predecessors, (106), 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-19 03:36:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:36:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:36:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:36:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 03:36:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-19 03:36:52,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:37:04,799 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:37:04,800 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 2562 treesize of output 2278 [2024-10-19 03:37:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1226173177, now seen corresponding path program 1 times [2024-10-19 03:37:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:37:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:37:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:37:05,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:37:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:37:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:37:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:37:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:37:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 03:37:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-19 03:37:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-19 03:37:05,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-19 03:37:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-19 03:37:05,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:37:05,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:37:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1136682792, now seen corresponding path program 3 times [2024-10-19 03:37:05,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:37:05,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624560098] [2024-10-19 03:37:05,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:37:05,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:37:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:37:09,354 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-19 03:37:09,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:37:09,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624560098] [2024-10-19 03:37:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624560098] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:37:09,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019067942] [2024-10-19 03:37:09,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 03:37:09,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:37:09,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:37:09,359 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-19 03:37:09,360 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-19 03:37:09,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-19 03:37:09,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 03:37:09,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-19 03:37:09,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:37:09,507 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-19 03:37:09,652 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-19 03:37:09,653 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-19 03:37:09,700 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-19 03:37:09,878 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-19 03:37:09,995 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-19 03:37:13,141 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-19 03:37:16,680 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-19 03:37:24,917 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 96 treesize of output 77 [2024-10-19 03:37:41,445 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 102 treesize of output 82 [2024-10-19 03:37:41,496 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-19 03:37:41,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:38:07,188 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |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_45|) 0))) is different from false [2024-10-19 03:38:08,905 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |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_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-19 03:38:10,867 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:38:12,900 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 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_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:38:13,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= 0 (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_47| (+ v_ArrVal_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2024-10-19 03:38:13,488 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (= 0 (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_47| (+ v_ArrVal_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-19 03:38:15,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (= (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_47| (+ v_ArrVal_721 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-19 03:38:17,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_721 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (= (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_718 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_721 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-19 03:38:19,767 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_718 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_721 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_49| (+ v_ArrVal_718 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-19 03:38:21,812 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_718 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_721 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (= (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_717) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_718 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_721 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_724) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-19 03:38:22,067 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-19 03:38:22,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019067942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 03:38:22,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 03:38:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2024-10-19 03:38:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851434521] [2024-10-19 03:38:22,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 03:38:22,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-19 03:38:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 03:38:22,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-19 03:38:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=897, Unknown=33, NotChecked=710, Total=1806 [2024-10-19 03:38:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:38:22,070 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 03:38:22,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 42 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 03:38:22,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:38:22,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:38:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:38:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-19 03:38:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-19 03:38:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-19 03:38:22,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 03:38:23,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:25,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:30,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:32,691 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-19 03:38:34,708 WARN L539 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-19 03:38:36,720 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-19 03:38:47,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:49,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:51,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:52,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:55,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:57,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:38:58,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:39:23,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-19 03:39:25,110 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-19 03:39:40,861 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-19 03:39:40,861 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 629 treesize of output 561 [2024-10-19 03:39:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1702530362, now seen corresponding path program 1 times [2024-10-19 03:39:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:39:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:39:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:39:40,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 03:39:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 03:39:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 03:39:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-19 03:39:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-19 03:39:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-19 03:39:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-19 03:39:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-19 03:39:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-19 03:39:41,078 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-19 03:39:41,261 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11 [2024-10-19 03:39:41,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-19 03:39:41,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 03:39:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1393116448, now seen corresponding path program 4 times [2024-10-19 03:39:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 03:39:41,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438302420] [2024-10-19 03:39:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 03:39:41,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 03:39:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 03:42:54,907 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-19 03:42:54,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 03:42:54,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438302420] [2024-10-19 03:42:54,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438302420] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 03:42:54,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926167676] [2024-10-19 03:42:54,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-19 03:42:54,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 03:42:54,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 03:42:54,909 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-19 03:42:54,910 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-19 03:42:56,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-19 03:42:56,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 03:42:56,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-19 03:42:56,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 03:42:56,051 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-19 03:42:56,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-19 03:42:56,169 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-19 03:42:56,266 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-19 03:42:56,420 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-19 03:42:56,546 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-19 03:42:59,173 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-19 03:42:59,390 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 54 treesize of output 43 [2024-10-19 03:43:09,465 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 44 treesize of output 35 [2024-10-19 03:43:14,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 154 [2024-10-19 03:43:29,715 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 356 treesize of output 311 [2024-10-19 03:44:09,428 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 365 treesize of output 320 [2024-10-19 03:44:37,221 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 1715 treesize of output 1524 [2024-10-19 03:48:45,397 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 3694 treesize of output 3228 [2024-10-19 03:48:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 125 refuted. 17 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-19 03:48:51,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 03:49:28,751 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:49:30,792 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:49:32,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_995 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (= (select (select (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_995 (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:49:34,892 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_68|) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2024-10-19 03:49:36,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0))) is different from false [2024-10-19 03:49:38,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_993 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0))) is different from false [2024-10-19 03:49:40,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_993 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2024-10-19 03:49:43,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (v_ArrVal_993 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 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_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0))) is different from false [2024-10-19 03:49:45,059 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0)))) is different from false [2024-10-19 03:49:45,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_38| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))))) is different from false [2024-10-19 03:49:47,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-19 03:49:49,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (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_988 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-19 03:49:51,382 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-19 03:49:53,416 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-19 03:49:55,543 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< (+ .cse2 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse2 |c_~#cache~0.offset|))))) is different from false [2024-10-19 03:49:57,649 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (= (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_984 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28) |c_~#cache~0.offset|) (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2024-10-19 03:49:59,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int))) (let ((.cse0 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| 28)) (< (+ |~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| (+ v_ArrVal_984 (- 1))) .cse0 (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 |~#cache~0.offset| .cse1))))) is different from false [2024-10-19 03:50:01,859 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_984 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int) (v_ArrVal_988 Int) (v_ArrVal_993 (Array Int Int)) (v_ArrVal_983 (Array Int Int))) (let ((.cse0 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| 28)) (< (+ |~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_983) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| (+ v_ArrVal_984 (- 1))) .cse0 (+ v_ArrVal_988 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| (+ v_ArrVal_990 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_993) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |v_t_funThread1of1ForFork0_~i~0#1_39| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 56 |~#cache~0.offset| .cse1))))) is different from false Killed by 15