./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -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/pthread-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -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-18 00:14:13,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 00:14:13,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 00:14:13,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 00:14:13,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 00:14:13,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 00:14:13,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 00:14:13,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 00:14:13,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 00:14:13,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 00:14:13,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 00:14:13,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 00:14:13,573 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 00:14:13,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 00:14:13,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 00:14:13,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 00:14:13,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 00:14:13,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 00:14:13,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 00:14:13,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 00:14:13,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 00:14:13,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 00:14:13,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 00:14:13,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 00:14:13,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 00:14:13,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 00:14:13,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 00:14:13,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 00:14:13,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 00:14:13,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 00:14:13,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 00:14:13,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 00:14:13,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 00:14:13,577 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 00:14:13,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 00:14:13,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 00:14:13,577 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 00:14:13,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 00:14:13,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 00:14:13,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 00:14:13,578 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 00:14:13,582 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Seed for random criterion -> 546 [2024-10-18 00:14:13,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 00:14:13,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 00:14:13,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 00:14:13,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 00:14:13,867 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 00:14:13,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 00:14:15,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 00:14:15,477 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 00:14:15,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-18 00:14:15,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/198910b11/077522fcccad4b059df6024b68996a4b/FLAG3662a8d66 [2024-10-18 00:14:15,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/198910b11/077522fcccad4b059df6024b68996a4b [2024-10-18 00:14:15,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 00:14:15,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 00:14:15,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 00:14:15,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 00:14:15,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 00:14:15,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 12:14:15" (1/1) ... [2024-10-18 00:14:15,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e121374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:15, skipping insertion in model container [2024-10-18 00:14:15,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 12:14:15" (1/1) ... [2024-10-18 00:14:15,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 00:14:15,841 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-18 00:14:15,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 00:14:15,869 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 00:14:15,922 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-18 00:14:15,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 00:14:16,024 INFO L204 MainTranslator]: Completed translation [2024-10-18 00:14:16,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16 WrapperNode [2024-10-18 00:14:16,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 00:14:16,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 00:14:16,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 00:14:16,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 00:14:16,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,095 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-18 00:14:16,096 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 00:14:16,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 00:14:16,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 00:14:16,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 00:14:16,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,116 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 00:14:16,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 00:14:16,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 00:14:16,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 00:14:16,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (1/1) ... [2024-10-18 00:14:16,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 00:14:16,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:16,201 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-18 00:14:16,205 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-18 00:14:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 00:14:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 00:14:16,276 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 00:14:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 00:14:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 00:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 00:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 00:14:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 00:14:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 00:14:16,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 00:14:16,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 00:14:16,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 00:14:16,280 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 00:14:16,481 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 00:14:16,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 00:14:16,677 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 00:14:16,677 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 00:14:16,803 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 00:14:16,804 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-18 00:14:16,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 12:14:16 BoogieIcfgContainer [2024-10-18 00:14:16,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 00:14:16,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 00:14:16,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 00:14:16,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 00:14:16,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 12:14:15" (1/3) ... [2024-10-18 00:14:16,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a96ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 12:14:16, skipping insertion in model container [2024-10-18 00:14:16,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:14:16" (2/3) ... [2024-10-18 00:14:16,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a96ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 12:14:16, skipping insertion in model container [2024-10-18 00:14:16,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 12:14:16" (3/3) ... [2024-10-18 00:14:16,815 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-18 00:14:16,828 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 00:14:16,828 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 00:14:16,829 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 00:14:16,859 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 00:14:16,889 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:16,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:16,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:16,892 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-18 00:14:16,893 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-18 00:14:16,965 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:16,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 00:14:16,989 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;@5e287f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:16,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 00:14:17,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:17,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:17,237 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-10-18 00:14:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:17,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511066498] [2024-10-18 00:14:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511066498] [2024-10-18 00:14:17,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511066498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:17,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:17,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:17,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685210952] [2024-10-18 00:14:17,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:17,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:17,525 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:17,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-18 00:14:17,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:17,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 00:14:17,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:17,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-10-18 00:14:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:17,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908812640] [2024-10-18 00:14:17,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:18,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:18,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908812640] [2024-10-18 00:14:18,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908812640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:18,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-18 00:14:18,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900099315] [2024-10-18 00:14:18,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 00:14:18,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:18,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 00:14:18,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 00:14:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:18,665 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:18,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 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-18 00:14:18,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:18,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:19,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-18 00:14:19,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-10-18 00:14:19,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:19,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739129727] [2024-10-18 00:14:19,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:19,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739129727] [2024-10-18 00:14:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739129727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135178516] [2024-10-18 00:14:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:19,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:19,975 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-18 00:14:19,983 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-18 00:14:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:20,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-18 00:14:20,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:20,140 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 00:14:20,141 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-18 00:14:20,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 106 [2024-10-18 00:14:20,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-10-18 00:14:20,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2024-10-18 00:14:20,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2024-10-18 00:14:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:22,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:14:23,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135178516] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:14:23,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:14:23,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-10-18 00:14:23,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666528362] [2024-10-18 00:14:23,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:14:23,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-18 00:14:23,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-18 00:14:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=732, Unknown=16, NotChecked=0, Total=930 [2024-10-18 00:14:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:23,740 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:23,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 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-18 00:14:23,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:23,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:23,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:24,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-18 00:14:24,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 00:14:24,166 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-18 00:14:24,354 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,SelfDestructingSolverStorable2 [2024-10-18 00:14:24,364 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 00:14:24,365 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 00:14:24,368 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:24,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:24,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:24,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 00:14:24,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-18 00:14:24,400 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:24,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 00:14:24,402 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;@5e287f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:24,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 00:14:24,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:24,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-10-18 00:14:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:24,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582217580] [2024-10-18 00:14:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:24,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:24,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582217580] [2024-10-18 00:14:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582217580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:24,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545699782] [2024-10-18 00:14:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:24,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:24,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:24,489 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:24,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-18 00:14:24,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:24,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-18 00:14:24,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:24,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-10-18 00:14:24,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:24,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903438338] [2024-10-18 00:14:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:24,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:24,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903438338] [2024-10-18 00:14:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903438338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:24,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-18 00:14:24,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148468899] [2024-10-18 00:14:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:24,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 00:14:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:24,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 00:14:24,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 00:14:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:24,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:24,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 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-18 00:14:24,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:24,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:25,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:25,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-18 00:14:25,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:25,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-10-18 00:14:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665341556] [2024-10-18 00:14:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:25,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 00:14:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:25,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 00:14:25,217 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 00:14:25,218 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 00:14:25,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-18 00:14:25,219 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 00:14:25,219 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 00:14:25,220 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 00:14:25,220 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 00:14:25,231 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 00:14:25,232 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:25,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:25,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:25,234 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-18 00:14:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-18 00:14:25,293 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:25,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:25,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 00:14:25,294 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;@5e287f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:25,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 00:14:25,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:25,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1146461421, now seen corresponding path program 1 times [2024-10-18 00:14:25,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:25,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197517466] [2024-10-18 00:14:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:25,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:25,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197517466] [2024-10-18 00:14:25,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197517466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:25,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:25,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827136445] [2024-10-18 00:14:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:25,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:25,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:25,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:25,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:25,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-18 00:14:25,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-18 00:14:26,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:26,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:26,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1959299849, now seen corresponding path program 1 times [2024-10-18 00:14:26,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:26,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043419026] [2024-10-18 00:14:26,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:26,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043419026] [2024-10-18 00:14:26,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043419026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:26,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:26,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-18 00:14:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202420183] [2024-10-18 00:14:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:26,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 00:14:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 00:14:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-18 00:14:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,428 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:26,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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-18 00:14:26,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:26,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-18 00:14:26,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:26,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1017090324, now seen corresponding path program 1 times [2024-10-18 00:14:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861403906] [2024-10-18 00:14:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:27,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861403906] [2024-10-18 00:14:27,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861403906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:27,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99955544] [2024-10-18 00:14:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:27,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:27,143 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-18 00:14:27,145 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-18 00:14:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:27,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-18 00:14:27,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:27,265 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 00:14:27,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 00:14:27,357 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 35 treesize of output 18 [2024-10-18 00:14:27,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-18 00:14:27,551 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 00:14:27,552 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-18 00:14:27,724 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-18 00:14:27,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-18 00:14:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:27,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:14:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99955544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:14:32,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:14:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-10-18 00:14:32,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368702861] [2024-10-18 00:14:32,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:14:32,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-18 00:14:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-18 00:14:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1119, Unknown=15, NotChecked=0, Total=1332 [2024-10-18 00:14:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:32,771 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:32,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 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-18 00:14:32,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:32,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:32,772 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-18 00:14:33,546 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-18 00:14:33,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-18 00:14:33,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 00:14:33,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1830282799, now seen corresponding path program 1 times [2024-10-18 00:14:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669116729] [2024-10-18 00:14:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:33,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 00:14:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 00:14:33,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 00:14:33,784 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 00:14:33,785 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 00:14:33,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-18 00:14:33,786 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-18 00:14:33,786 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 00:14:33,786 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 00:14:33,786 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 00:14:33,815 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 00:14:33,817 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 00:14:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 00:14:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:33,819 INFO L229 MonitoredProcess]: Starting monitored process 7 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-18 00:14:33,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-18 00:14:33,856 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 00:14:33,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:33,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 00:14:33,857 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;@5e287f07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=RANDOM, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546, mConComCheckerConditionCriterion=false [2024-10-18 00:14:33,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 00:14:35,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:35,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash 289691451, now seen corresponding path program 1 times [2024-10-18 00:14:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757949941] [2024-10-18 00:14:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:14:35,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:35,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757949941] [2024-10-18 00:14:35,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757949941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:35,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:35,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 00:14:35,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007229810] [2024-10-18 00:14:35,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:35,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-18 00:14:35,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:35,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-18 00:14:35,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-18 00:14:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:35,085 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:35,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-18 00:14:35,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:35,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-18 00:14:35,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1893296980, now seen corresponding path program 1 times [2024-10-18 00:14:35,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209371033] [2024-10-18 00:14:35,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:14:36,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209371033] [2024-10-18 00:14:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209371033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 00:14:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-18 00:14:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986745985] [2024-10-18 00:14:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:36,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-18 00:14:36,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-18 00:14:36,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-18 00:14:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:36,270 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:36,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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-18 00:14:36,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:36,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:36,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:36,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:36,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-18 00:14:36,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash -708586065, now seen corresponding path program 1 times [2024-10-18 00:14:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451735815] [2024-10-18 00:14:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451735815] [2024-10-18 00:14:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451735815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772428679] [2024-10-18 00:14:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:37,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:37,157 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-18 00:14:37,159 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-18 00:14:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:37,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-18 00:14:37,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:37,303 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 00:14:37,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 00:14:37,408 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 35 treesize of output 18 [2024-10-18 00:14:37,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-18 00:14:37,612 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 00:14:37,612 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-18 00:14:37,792 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-18 00:14:37,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-18 00:14:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:37,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:14:38,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (not .cse0) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse1 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-18 00:14:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772428679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:14:44,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:14:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-10-18 00:14:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205766787] [2024-10-18 00:14:44,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:14:44,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-18 00:14:44,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:44,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-18 00:14:44,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1073, Unknown=12, NotChecked=68, Total=1332 [2024-10-18 00:14:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:44,385 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:44,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 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-18 00:14:44,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:44,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:44,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:45,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-18 00:14:46,014 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-18 00:14:46,202 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,SelfDestructingSolverStorable12 [2024-10-18 00:14:46,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:46,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash -857142964, now seen corresponding path program 1 times [2024-10-18 00:14:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535588084] [2024-10-18 00:14:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 00:14:46,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:46,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535588084] [2024-10-18 00:14:46,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535588084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167734014] [2024-10-18 00:14:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:46,750 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-18 00:14:46,751 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-18 00:14:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:46,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-18 00:14:46,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:46,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-18 00:14:46,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-18 00:14:46,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:14:46,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-10-18 00:14:46,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:46,869 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 36 treesize of output 17 [2024-10-18 00:14:46,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:14:46,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-18 00:14:46,986 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-10-18 00:14:46,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2024-10-18 00:14:46,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-18 00:14:47,050 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-18 00:14:47,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-18 00:14:47,105 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-10-18 00:14:47,106 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 1 case distinctions, treesize of input 26 treesize of output 26 [2024-10-18 00:14:47,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:47,113 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-18 00:14:47,113 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 1 case distinctions, treesize of input 19 treesize of output 1 [2024-10-18 00:14:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:14:47,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 00:14:47,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167734014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:14:47,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 00:14:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-18 00:14:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177208900] [2024-10-18 00:14:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:14:47,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-18 00:14:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-18 00:14:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-18 00:14:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:47,176 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:47,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:47,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:47,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-18 00:14:47,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-18 00:14:50,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:14:50,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-18 00:14:50,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:50,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:14:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:14:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1144401957, now seen corresponding path program 1 times [2024-10-18 00:14:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:14:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569662461] [2024-10-18 00:14:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:14:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:14:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:14:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569662461] [2024-10-18 00:14:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569662461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:14:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730077060] [2024-10-18 00:14:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:14:52,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:14:52,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:14:52,820 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:14:52,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-18 00:14:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:14:52,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-18 00:14:52,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:14:52,955 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 00:14:52,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 00:14:53,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-18 00:14:53,036 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-18 00:14:53,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-18 00:14:53,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-18 00:14:53,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-18 00:14:53,213 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-18 00:14:53,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-18 00:14:53,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:14:53,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2024-10-18 00:14:53,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-10-18 00:14:53,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2024-10-18 00:14:53,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:14:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:53,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:14:54,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:14:54,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 00:14:54,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 237 [2024-10-18 00:14:54,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 00:14:54,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2024-10-18 00:14:54,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 00:14:54,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2024-10-18 00:14:54,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-10-18 00:14:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:14:57,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730077060] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:14:57,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:14:57,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-10-18 00:14:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55188874] [2024-10-18 00:14:57,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:14:57,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-18 00:14:57,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:14:57,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-18 00:14:57,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1825, Unknown=15, NotChecked=0, Total=1980 [2024-10-18 00:14:57,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:57,253 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:14:57,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 44 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:14:57,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:14:57,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:14:57,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-18 00:14:57,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:14:57,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:15:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-18 00:15:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:15:00,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 00:15:00,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-18 00:15:00,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-18 00:15:00,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:15:00,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:15:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash -830412570, now seen corresponding path program 2 times [2024-10-18 00:15:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:15:00,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380021887] [2024-10-18 00:15:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:15:00,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:15:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:15:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 00:15:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:15:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380021887] [2024-10-18 00:15:01,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380021887] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:15:01,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468106153] [2024-10-18 00:15:01,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 00:15:01,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:15:01,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:15:01,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:15:01,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-18 00:15:01,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 00:15:01,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 00:15:01,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-18 00:15:01,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:15:02,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:15:02,130 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-10-18 00:15:02,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 92 [2024-10-18 00:15:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 00:15:02,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:15:02,881 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-18 00:15:02,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2024-10-18 00:15:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-18 00:15:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468106153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:15:02,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:15:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 28 [2024-10-18 00:15:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243375520] [2024-10-18 00:15:02,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:15:02,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-18 00:15:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:15:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-18 00:15:02,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=668, Unknown=3, NotChecked=0, Total=812 [2024-10-18 00:15:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:02,885 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:15:02,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5) internal successors, (98), 29 states have internal predecessors, (98), 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-18 00:15:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:15:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-10-18 00:15:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:15:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 00:15:02,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:06,190 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-18 00:15:09,555 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-18 00:15:15,118 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, 1] [2024-10-18 00:15:17,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:15:19,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:15:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:15:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-18 00:15:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:15:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-18 00:15:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-18 00:15:19,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-18 00:15:19,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-18 00:15:19,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:15:19,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:15:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1027000466, now seen corresponding path program 1 times [2024-10-18 00:15:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:15:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092504471] [2024-10-18 00:15:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:15:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:15:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:15:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:15:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:15:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092504471] [2024-10-18 00:15:20,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092504471] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:15:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969057970] [2024-10-18 00:15:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:15:20,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:15:20,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:15:20,618 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:15:20,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-18 00:15:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:15:20,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-18 00:15:20,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:15:20,767 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 00:15:20,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 00:15:20,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-18 00:15:20,859 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-18 00:15:20,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-18 00:15:20,973 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-18 00:15:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-18 00:15:21,117 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 19 treesize of output 11 [2024-10-18 00:15:21,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2024-10-18 00:15:21,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-18 00:15:21,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:15:21,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 3 [2024-10-18 00:15:21,214 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-10-18 00:15:21,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 111 [2024-10-18 00:15:21,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:15:21,303 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-10-18 00:15:21,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 56 [2024-10-18 00:15:21,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-18 00:15:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:15:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:15:21,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:15:22,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (let ((.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3)))) (or .cse0 (forall ((v_DerPreprocessor_32 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_32 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2024-10-18 00:15:22,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2))))) is different from false [2024-10-18 00:15:25,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:15:25,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-10-18 00:15:25,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-18 00:15:25,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 00:15:25,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-10-18 00:15:25,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 00:15:25,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2787 treesize of output 2354 [2024-10-18 00:15:25,989 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-10-18 00:15:25,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-10-18 00:15:26,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-10-18 00:15:26,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:15:26,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-18 00:15:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-10-18 00:15:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969057970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:15:26,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:15:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 16] total 44 [2024-10-18 00:15:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884546782] [2024-10-18 00:15:26,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:15:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-18 00:15:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:15:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-18 00:15:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1540, Unknown=7, NotChecked=162, Total=1892 [2024-10-18 00:15:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:26,086 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:15:26,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 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-18 00:15:26,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:26,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:15:26,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-18 00:15:26,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:15:26,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-18 00:15:26,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-18 00:15:26,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:28,950 WARN L851 $PredicateComparison]: unable to prove that (and (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2))))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))) is different from false [2024-10-18 00:15:32,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse3 (not .cse2))) (and (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3)))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) .cse3)))) is different from false [2024-10-18 00:15:33,908 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2))))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))) is different from false [2024-10-18 00:15:34,328 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (mod (select .cse5 |c_~#value~0.offset|) 4294967296))) (let ((.cse8 (= .cse6 .cse3))) (let ((.cse0 (not .cse8)) (.cse7 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse0 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse1 (store .cse2 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (let ((.cse4 (select .cse1 |c_~#value~0.base|))) (< (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse1 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (< .cse6 .cse3) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse3 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse7) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse3 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse7))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or .cse8 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse10 (store .cse9 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse11 (select .cse10 |c_~#value~0.base|))) (< (mod (select .cse11 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse10 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse0 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse15 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15))) (let ((.cse13 (store .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (< (mod (select .cse14 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse7)))))) is different from false [2024-10-18 00:15:39,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|)) (.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse6 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|))) (let ((.cse7 (= .cse6 1)) (.cse4 (not .cse3)) (.cse0 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse5 (select .cse2 |c_~#value~0.offset|))) (and (= (select |c_#valid| 3) 1) .cse0 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (or (let ((.cse1 (mod .cse5 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4))) (< 0 (mod .cse6 4294967296)) (< 0 (mod |c_thr1Thread2of3ForFork0_#t~mem6#1| 4294967296))) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (and .cse7 (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1)) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse7 .cse4 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse5) .cse0 (let ((.cse8 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|))) (or (and .cse8 (= 1 .cse5)) (and .cse8 (= 0 .cse5))))))))) is different from false [2024-10-18 00:15:41,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse18 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse19 (mod (select .cse9 |c_~#value~0.offset|) 4294967296))) (let ((.cse4 (= .cse18 .cse19))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse4)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (and (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 1) (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1)) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse13 (store .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (< (mod (select .cse14 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse15 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse15 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse16 (select .cse15 |c_~#value~0.base|))) (< (mod (select .cse16 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse15 |c_~#value~0.base| (store .cse16 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) (not .cse11)) (< .cse18 .cse19) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|)))))) is different from false [2024-10-18 00:15:42,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse26 (select .cse9 |c_~#value~0.offset|))) (let ((.cse24 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse25 (mod .cse26 4294967296)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse16 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse13 (not .cse11)) (.cse12 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse27 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse28 (= 0 .cse26)) (.cse4 (= .cse24 .cse25))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse4)) (.cse14 (and .cse12 .cse27 .cse28)) (.cse15 (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse25 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse25 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse13))) (.cse23 (= .cse16 1))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) .cse12 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (or (= |c_thr1Thread3of3ForFork0_#t~mem6#1| 1) .cse13 .cse14) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse15 (< 0 (mod .cse16 4294967296))) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse18 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse18 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse19 (select .cse18 |c_~#value~0.base|))) (< (mod (select .cse19 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse18 |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse22 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse20 (store .cse22 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse21 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse20 |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) .cse13) (or .cse23 .cse13 .cse14) (< .cse24 .cse25) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse15 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or .cse23 .cse13 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse26) .cse12 (or (and .cse27 (= 1 .cse26)) (and .cse27 .cse28)))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1))))))) is different from false [2024-10-18 00:15:42,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse26 (select .cse9 |c_~#value~0.offset|))) (let ((.cse25 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse13 (mod .cse26 4294967296))) (let ((.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse15 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse4 (= .cse25 .cse13))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse4)) (.cse22 (= .cse15 1)) (.cse14 (not .cse11)) (.cse12 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse23 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse24 (= 0 .cse26))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) .cse12 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse13 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse13 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse14)) (< 0 (mod .cse15 4294967296))) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse17 (store .cse16 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse18 (select .cse17 |c_~#value~0.base|))) (< (mod (select .cse18 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse17 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse19 (store .cse21 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse19 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse20 (select .cse19 |c_~#value~0.base|))) (< (mod (select .cse20 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse19 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) .cse14) (or .cse22 .cse14 (and .cse12 .cse23 .cse24)) (< .cse25 .cse13) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse22 .cse14 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse26) .cse12 (or (and .cse23 (= 1 .cse26)) (and .cse23 .cse24)))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1))))))) is different from false [2024-10-18 00:15:48,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#value~0.base|)) (.cse14 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse11 (not .cse14)) (.cse6 (mod (select .cse8 |c_~#value~0.offset|) 4294967296))) (let ((.cse15 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse6)) (.cse0 (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse14)) (.cse1 (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11))) (let ((.cse2 (and .cse0 .cse1)) (.cse3 (not .cse15))) (and .cse0 .cse1 (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse2 (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or .cse3 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse4 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (let ((.cse7 (select .cse4 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse4 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse9 (select .cse10 |c_~#value~0.base|))) (< (mod (select .cse9 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse10 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse11) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse12 (select .cse13 |c_~#value~0.base|))) (< (mod (select .cse12 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse13 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse14)) (= .cse6 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse2 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) .cse11) (or .cse15 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse17 (store .cse16 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse18 (select .cse17 |c_~#value~0.base|))) (< (mod (select .cse18 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse17 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse3 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse22 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse20 (store .cse19 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse21 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse14)))))) is different from false [2024-10-18 00:15:49,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|)) (.cse4 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse1 (select .cse3 |c_~#value~0.offset|))) (and (or .cse0 (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|) (or (= 0 .cse1) (= 1 .cse1)))) (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse2 (mod .cse1 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse2 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse2 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse0))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) is different from false [2024-10-18 00:15:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:15:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:15:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-18 00:15:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:15:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-18 00:15:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-18 00:15:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-10-18 00:15:49,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-18 00:15:49,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-18 00:15:49,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:15:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:15:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash -573380990, now seen corresponding path program 1 times [2024-10-18 00:15:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:15:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923486332] [2024-10-18 00:15:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:15:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:15:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:15:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:15:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:15:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923486332] [2024-10-18 00:15:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923486332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:15:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707555449] [2024-10-18 00:15:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:15:51,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:15:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:15:51,759 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:15:51,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-18 00:15:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:15:51,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-18 00:15:51,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:15:51,915 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 00:15:51,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 00:15:51,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-18 00:15:52,002 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-18 00:15:52,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-18 00:15:52,122 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-18 00:15:52,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-18 00:15:52,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-18 00:15:52,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-18 00:15:52,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:15:52,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 121 [2024-10-18 00:15:52,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2024-10-18 00:15:52,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:15:52,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:15:52,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 67 [2024-10-18 00:15:52,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 17 treesize of output 8 [2024-10-18 00:15:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:15:52,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:15:56,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse0 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse6 |c_~#value~0.offset|) 4294967296)))) (let ((.cse9 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (.cse2 (not .cse0)) (.cse7 (not .cse3))) (and (or (and (or .cse0 (forall ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_ArrVal_626 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (mod (select v_DerPreprocessor_48 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_50))) (store (store .cse1 |c_~#value~0.base| v_DerPreprocessor_47) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_626)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or .cse2 (and (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_49 (Array Int Int)) (v_ArrVal_626 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (mod (select v_DerPreprocessor_48 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse5 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse5))) (store (store .cse4 |c_~#value~0.base| v_DerPreprocessor_47) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_49) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_626)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or .cse7 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_626 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (mod (select v_DerPreprocessor_48 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store (store .cse8 |c_~#value~0.base| v_DerPreprocessor_47) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse8 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_626)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))) .cse9) (or (not .cse9) (and (or (forall ((v_prenex_56 Int) (v_prenex_57 Int) (v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select v_DerPreprocessor_48 v_prenex_57) 4294967296)) (< 0 (mod (select (select (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store v_DerPreprocessor_48 |c_~#value~0.offset| v_prenex_56)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_57 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) .cse2 .cse7) (or .cse0 (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_prenex_56 Int) (v_prenex_57 Int) (v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select v_DerPreprocessor_48 v_prenex_57) 4294967296)) (< 0 (mod (select (select (let ((.cse11 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_51))) (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store v_DerPreprocessor_48 |c_~#value~0.offset| v_prenex_56)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_57 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))))))))) is different from false [2024-10-18 00:15:56,445 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-10-18 00:15:56,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2024-10-18 00:15:56,477 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-10-18 00:15:56,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2024-10-18 00:15:57,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:15:57,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:15:57,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:16:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 9 refuted. 6 times theorem prover too weak. 2 trivial. 3 not checked. [2024-10-18 00:16:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707555449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:16:01,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:16:01,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 15] total 49 [2024-10-18 00:16:01,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338710935] [2024-10-18 00:16:01,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:16:01,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-18 00:16:01,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:16:01,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-18 00:16:01,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2111, Unknown=30, NotChecked=94, Total=2450 [2024-10-18 00:16:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:01,913 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:16:01,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.32) internal successors, (116), 49 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 00:16:01,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:01,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:16:01,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-10-18 00:16:01,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:16:01,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-18 00:16:01,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-18 00:16:01,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-10-18 00:16:01,914 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-10-18 00:16:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-18 00:16:24,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-18 00:16:24,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-18 00:16:24,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:16:24,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:16:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 693590328, now seen corresponding path program 1 times [2024-10-18 00:16:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:16:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949915519] [2024-10-18 00:16:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:16:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:16:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:16:26,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:16:26,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:16:26,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949915519] [2024-10-18 00:16:26,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949915519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:16:26,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952483401] [2024-10-18 00:16:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:16:26,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:16:26,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:16:26,132 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:16:26,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-18 00:16:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:16:26,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 00:16:26,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:16:26,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-18 00:16:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:16:26,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 00:16:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952483401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 00:16:26,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-18 00:16:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2024-10-18 00:16:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788599632] [2024-10-18 00:16:26,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 00:16:26,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 00:16:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:16:26,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 00:16:26,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-18 00:16:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:26,447 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:16:26,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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-18 00:16:26,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:26,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:16:26,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:16:26,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:16:26,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-18 00:16:26,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-10-18 00:16:26,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-10-18 00:16:26,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-18 00:16:26,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:36,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (select .cse6 |c_~#value~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse1 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse2 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse4 (not .cse7))) (and (or (= .cse0 1) (and .cse1 (or (and .cse2 (= 1 .cse3)) (and .cse2 (= 0 .cse3)))) .cse4) (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse5 (mod .cse3 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse5 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse7) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse5 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4))) (< 0 (mod .cse0 4294967296))) (or (and .cse1 .cse2) .cse4)))) is different from false [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-18 00:16:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 00:16:39,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-18 00:16:39,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:16:39,618 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:16:39,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:16:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash -579704076, now seen corresponding path program 1 times [2024-10-18 00:16:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:16:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069661186] [2024-10-18 00:16:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:16:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:16:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:16:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:16:42,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:16:42,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069661186] [2024-10-18 00:16:42,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069661186] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:16:42,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768904183] [2024-10-18 00:16:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:16:42,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:16:42,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:16:42,115 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:16:42,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-18 00:16:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:16:42,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-18 00:16:42,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:16:42,389 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 00:16:42,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 00:16:42,671 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 21 treesize of output 5 [2024-10-18 00:16:42,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 00:16:42,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-18 00:16:43,182 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-18 00:16:43,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-18 00:16:43,838 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-18 00:16:43,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-18 00:16:44,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 87 [2024-10-18 00:16:44,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:16:44,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 37 [2024-10-18 00:16:44,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-18 00:16:44,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-18 00:16:44,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:16:44,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 90 [2024-10-18 00:16:44,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2024-10-18 00:16:44,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-10-18 00:16:44,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 00:16:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:16:45,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:16:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:16:50,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768904183] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:16:50,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:16:50,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 13] total 49 [2024-10-18 00:16:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724404680] [2024-10-18 00:16:50,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:16:50,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-18 00:16:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:16:50,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-18 00:16:50,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2148, Unknown=2, NotChecked=0, Total=2352 [2024-10-18 00:16:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:50,484 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:16:50,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 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-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 00:16:50,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:17:09,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:17:14,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:17:27,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:17:31,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:17:47,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:18:00,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:18:02,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:18:04,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse33 (select .cse22 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse33 4294967296)) (.cse7 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse11 (= .cse0 .cse7))) (let ((.cse16 (not .cse11)) (.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse22 |c_~#value~0.offset| (+ 1 .cse33)))) (.cse23 (div .cse33 4294967296)) (.cse4 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store (select .cse5 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (select (store .cse5 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| .cse2) |c_~#value~0.base|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)) (< .cse0 (mod (select (select (let ((.cse1 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) .cse4)))))) (= (select |c_#valid| 3) 1) (or (forall ((v_DerPreprocessor_55 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_55))) (let ((.cse6 (select .cse10 |c_~#value~0.base|))) (let ((.cse8 (let ((.cse9 (store .cse10 |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (not (= .cse4 (mod (select .cse6 |c_~#value~0.offset|) 4294967296))) (< .cse7 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse8 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))) .cse11) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse15 (store (select .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (select (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base|))) (let ((.cse13 (let ((.cse14 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (not (= .cse4 (mod (select .cse12 |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse13 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) (or .cse16 (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (store |c_#memory_int| |c_~#value~0.base| (store .cse22 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))))) (let ((.cse20 (store (select .cse21 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse17 (select (store .cse21 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse20) |c_~#value~0.base|))) (let ((.cse18 (let ((.cse19 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse20) |c_~#value~0.base| (store .cse17 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse19 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse19 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (not (= .cse4 (mod (select .cse17 |c_~#value~0.offset|) 4294967296))) (< .cse7 (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse18 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))) (<= .cse23 0) (or .cse16 (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse28 (store |c_#memory_int| |c_~#value~0.base| (store .cse22 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)))) (let ((.cse27 (store (select .cse28 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse25 (select (store .cse28 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse27) |c_~#value~0.base|))) (let ((.cse24 (let ((.cse26 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse27) |c_~#value~0.base| (store .cse25 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse26 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse26 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (< .cse7 (mod (select (select .cse24 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse24 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (mod (select .cse25 |c_~#value~0.offset|) 4294967296) .cse4))))))))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| Int)) (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse32 (store (select .cse5 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse30 (select (store .cse5 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| .cse32) |c_~#value~0.base|))) (let ((.cse29 (let ((.cse31 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21| .cse32) |c_~#value~0.base| (store .cse30 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse31 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse31 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (< .cse0 (mod (select (select .cse29 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse29 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (mod (select .cse30 |c_~#value~0.offset|) 4294967296) .cse4))))))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_21|) 0)))) (<= (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* .cse23 4294967296) 1) (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse33)) (or (not (= .cse4 .cse0)) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse34 (let ((.cse35 (store |c_#memory_int| |c_~#value~0.base| (store .cse22 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse35 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse35 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (< .cse7 (mod (select (select .cse34 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse34 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) (= |c_~#value~0.base| 3) (<= 1 (mod (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 4294967296)) (not (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)))))))) is different from false [2024-10-18 00:18:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:18:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:18:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:18:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:18:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-18 00:18:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-10-18 00:18:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-10-18 00:18:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-18 00:18:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:18:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-18 00:18:20,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-18 00:18:20,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:18:20,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:18:21,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:18:21,066 INFO L85 PathProgramCache]: Analyzing trace with hash -103544725, now seen corresponding path program 1 times [2024-10-18 00:18:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:18:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696389370] [2024-10-18 00:18:21,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:18:21,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:18:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:18:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:18:21,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:18:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696389370] [2024-10-18 00:18:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696389370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:18:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713678137] [2024-10-18 00:18:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:18:21,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:18:21,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:18:21,795 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:18:21,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-18 00:18:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:18:21,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-18 00:18:21,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:18:21,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-18 00:18:21,972 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 00:18:21,972 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-18 00:18:22,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-18 00:18:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-18 00:18:22,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-10-18 00:18:22,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2024-10-18 00:18:22,406 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-10-18 00:18:22,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 180 [2024-10-18 00:18:22,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2024-10-18 00:18:22,522 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-10-18 00:18:22,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 38 [2024-10-18 00:18:22,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:18:22,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 00:18:22,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-18 00:18:22,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:18:22,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2024-10-18 00:18:22,840 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-18 00:18:22,841 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 2 case distinctions, treesize of input 21 treesize of output 15 [2024-10-18 00:18:22,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 00:18:23,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-10-18 00:18:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:18:23,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:18:23,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-10-18 00:18:25,347 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-10-18 00:18:25,348 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2024-10-18 00:18:25,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 00:18:25,380 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 47 treesize of output 43 [2024-10-18 00:18:25,395 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:18:25,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 00:18:25,479 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 00:18:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713678137] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:18:25,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:18:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 26 [2024-10-18 00:18:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812982001] [2024-10-18 00:18:25,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:18:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-18 00:18:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:18:25,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-18 00:18:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=540, Unknown=8, NotChecked=0, Total=650 [2024-10-18 00:18:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:18:25,481 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:18:25,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 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-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-18 00:18:25,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:18:58,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:19:02,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:19:20,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:19:25,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (select .cse10 |c_~#value~0.offset|)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse1 (not .cse11)) (.cse6 (mod .cse2 4294967296))) (let ((.cse22 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse6)) (.cse0 (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11)) (.cse3 (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse1))) (let ((.cse12 (and .cse0 .cse3)) (.cse4 (not .cse22))) (and .cse0 (or .cse1 (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|) (= 0 .cse2))) .cse3 (or .cse4 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse9 (store .cse5 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (let ((.cse7 (select .cse9 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse11) (or .cse12 (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or .cse4 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse13 (store .cse14 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (< 0 (mod (select (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (let ((.cse15 (select .cse13 |c_~#value~0.base|))) (< (mod (select .cse15 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse4 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse16 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (let ((.cse18 (select .cse16 |c_~#value~0.base|))) (< (mod (select .cse18 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse16 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (v_DerPreprocessor_34 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse21 (store .cse19 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (= (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (let ((.cse20 (select .cse21 |c_~#value~0.base|))) (< (mod (select .cse20 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse21 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse21 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse22) (or .cse12 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or .cse22 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse24 (store .cse23 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (< 0 (mod (select (select .cse24 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse25 (select .cse24 |c_~#value~0.base|))) (< (mod (select .cse25 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse24 |c_~#value~0.base| (store .cse25 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse4 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse29 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse26 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse29))) (let ((.cse27 (store .cse26 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse26 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (< 0 (mod (select (select .cse27 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse28 (select .cse27 |c_~#value~0.base|))) (< (mod (select .cse28 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse29) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse28 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse11))))))) is different from false [2024-10-18 00:19:33,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:19:33,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-18 00:19:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:19:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-18 00:19:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-18 00:19:34,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-18 00:19:34,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:19:34,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:19:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:19:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1947888552, now seen corresponding path program 2 times [2024-10-18 00:19:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:19:34,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436114567] [2024-10-18 00:19:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:19:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:19:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:19:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:19:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:19:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436114567] [2024-10-18 00:19:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436114567] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:19:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919056424] [2024-10-18 00:19:44,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 00:19:44,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:19:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:19:44,696 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:19:44,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-18 00:19:44,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 00:19:44,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 00:19:44,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-18 00:19:44,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:19:45,315 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-18 00:19:45,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-18 00:19:46,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 00:19:46,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2024-10-18 00:19:46,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:19:46,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-18 00:19:46,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-18 00:19:47,350 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-18 00:19:47,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-18 00:19:48,129 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-18 00:19:48,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-18 00:19:48,971 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-18 00:19:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 42 [2024-10-18 00:19:49,095 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-18 00:19:49,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 39 [2024-10-18 00:19:49,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-18 00:19:49,214 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-18 00:19:49,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-10-18 00:19:50,006 INFO L349 Elim1Store]: treesize reduction 111, result has 25.5 percent of original size [2024-10-18 00:19:50,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 152 [2024-10-18 00:19:50,171 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-18 00:19:50,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-10-18 00:19:51,211 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-18 00:19:51,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-10-18 00:19:52,012 INFO L349 Elim1Store]: treesize reduction 140, result has 48.0 percent of original size [2024-10-18 00:19:52,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 177 treesize of output 261 [2024-10-18 00:19:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:19:52,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:19:53,183 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_71 (Array Int Int))) (< 0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73))) (or (not (= (select .cse0 |c_~#value~0.base|) v_DerPreprocessor_72)) (< 0 (mod (select (select .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) is different from false [2024-10-18 00:19:53,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (and (or .cse0 (and (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_76) |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73))) (or (not (= v_DerPreprocessor_72 (select .cse1 |c_~#value~0.base|))) (< 0 (mod (select (select .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (forall ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (<= 1 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or (not .cse0) (let ((.cse5 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (let ((.cse2 (not .cse5))) (and (or .cse2 (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73))) (or (< 0 (mod (select (select .cse3 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= v_DerPreprocessor_72 (select .cse3 |c_~#value~0.base|))))))) (or .cse5 (forall ((v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_74) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (or (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse5) (or .cse2 (forall ((v_DerPreprocessor_71 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))))))) is different from false [2024-10-18 00:19:56,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_911))) (or (not (= (select .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select (store .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0))))) is different from false [2024-10-18 00:19:56,550 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod |c_thr1Thread1of3ForFork0_#t~mem6#1| 4294967296) 0) (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_911))) (or (not (= (select .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select (store .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0)))))) is different from false [2024-10-18 00:19:56,615 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |c_thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_911))) (or (not (= (select .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select (store .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0)))))) is different from false [2024-10-18 00:19:57,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296)))) (and (or (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (v_DerPreprocessor_77 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_911))) (or (not (= (select .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (= (mod (select v_DerPreprocessor_77 |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_77) |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select (store .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0))))) .cse1) (or (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_ArrVal_910 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_911))) (or (not (= (select .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_910) |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select (store .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0))))) (not .cse1)))) is different from false [2024-10-18 00:19:57,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_ArrVal_910 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_911))) (or (not (= (select .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_910) |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select (store .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0))))) is different from false [2024-10-18 00:19:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 1 refuted. 6 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-18 00:19:57,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919056424] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:19:57,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:19:57,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 14] total 54 [2024-10-18 00:19:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440995632] [2024-10-18 00:19:57,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:19:57,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-18 00:19:57,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:19:57,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-18 00:19:57,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2106, Unknown=15, NotChecked=686, Total=2970 [2024-10-18 00:19:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:19:57,696 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:19:57,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 54 states have internal predecessors, (113), 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-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:19:57,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2024-10-18 00:19:57,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-18 00:19:57,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:20:13,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:20:13,952 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_71 (Array Int Int))) (< 0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_ArrVal_910 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_ArrVal_911))) (or (not (= (select .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_910) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) 0)) (not (= (select (store .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0))))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73))) (or (not (= (select .cse1 |c_~#value~0.base|) v_DerPreprocessor_72)) (< 0 (mod (select (select .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) is different from false [2024-10-18 00:20:19,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse14 (select .cse13 |c_~#value~0.offset|)) (.cse23 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse1 (not .cse23)) (.cse11 (mod .cse14 4294967296))) (let ((.cse15 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse11)) (.cse0 (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse11 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse23)) (.cse5 (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse11 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse1))) (let ((.cse6 (and .cse0 .cse5)) (.cse7 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse2 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse3 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse4 (= 0 .cse14)) (.cse8 (not .cse15))) (and .cse0 (or .cse1 (and .cse2 .cse3 .cse4)) .cse5 (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse6 (< 0 (mod .cse7 4294967296))) (or .cse8 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse9 (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11) (let ((.cse12 (select .cse9 |c_~#value~0.base|))) (< (mod (select .cse12 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse9 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse6 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or (= .cse7 1) .cse1 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse14) .cse2 (or (and .cse3 (= 1 .cse14)) (and .cse3 .cse4)))) (or .cse15 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse17 (store .cse16 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11) (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse18 (select .cse17 |c_~#value~0.base|))) (< (mod (select .cse18 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse17 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse8 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse22 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse20 (store .cse19 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11) (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse21 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse23))))))) is different from false [2024-10-18 00:20:42,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:21:09,613 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 [1] [2024-10-18 00:21:11,723 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (select .cse1 |c_~#value~0.offset|))) (and (= (select |c_#valid| 3) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse0 (mod .cse3 4294967296)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2)))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (not (= (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse3) (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse3 4294967296) 4294967296))))))) is different from false [2024-10-18 00:21:15,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:21:18,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:21:18,550 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse7 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (mod (select .cse7 |c_~#value~0.offset|) 4294967296)) (.cse2 (not .cse5))) (and (= (select |c_#valid| 3) 1) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse0 (select .cse1 |c_~#value~0.base|))) (< (mod (select .cse0 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse1 |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse2) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse3 (select .cse4 |c_~#value~0.base|))) (< (mod (select .cse3 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse4 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse4 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse5)) (= .cse6 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse5) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2)) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) is different from false [2024-10-18 00:21:53,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:05,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:07,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:15,820 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse30 (select .cse9 |c_~#value~0.offset|))) (let ((.cse13 (mod .cse30 4294967296))) (let ((.cse4 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse13)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse35 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse26 (not .cse11)) (.cse10 (not .cse4))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) (or .cse10 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse15 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse12 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15))) (let ((.cse16 (store .cse12 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (= (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (let ((.cse14 (select .cse16 |c_~#value~0.base|))) (< (mod (select .cse14 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse11) (or .cse10 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse18 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse17 (store .cse18 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (let ((.cse19 (select .cse17 |c_~#value~0.base|))) (< (mod (select .cse19 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse17 |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse21 (store .cse20 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse20 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse21 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse22 (select .cse21 |c_~#value~0.base|))) (< (mod (select .cse22 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse21 |c_~#value~0.base| (store .cse22 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse25 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse23 (store .cse25 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse23 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse24 (select .cse23 |c_~#value~0.base|))) (< (mod (select .cse24 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse23 |c_~#value~0.base| (store .cse24 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse25 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) .cse26) (or .cse10 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse28 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse27 (store .cse28 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse27 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse28 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (let ((.cse29 (select .cse27 |c_~#value~0.base|))) (< (mod (select .cse29 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse27 |c_~#value~0.base| (store .cse29 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (= (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1) .cse30) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse32 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse31 (select .cse32 |c_~#value~0.base|))) (< (mod (select .cse31 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse32 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse32 |c_~#value~0.base| (store .cse31 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse32 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse26) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse34 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse33 (select .cse34 |c_~#value~0.base|))) (< (mod (select .cse33 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse34 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse34 |c_~#value~0.base| (store .cse33 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse34 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse11)) (= .cse13 .cse1)) (or .cse26 (and (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) .cse35)) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (v_DerPreprocessor_34 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse36 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse38 (store .cse36 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (= (mod (select (select .cse36 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (let ((.cse37 (select .cse38 |c_~#value~0.base|))) (< (mod (select .cse37 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse38 |c_~#value~0.base| (store .cse37 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse38 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) .cse35) .cse26) (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse40 (store .cse39 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse39 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (< 0 (mod (select (select .cse40 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse41 (select .cse40 |c_~#value~0.base|))) (< (mod (select .cse41 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse40 |c_~#value~0.base| (store .cse41 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse10 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse45 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse42 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse45))) (let ((.cse43 (store .cse42 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse42 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse13) (< 0 (mod (select (select .cse43 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse44 (select .cse43 |c_~#value~0.base|))) (< (mod (select .cse44 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse45) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse44 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse11))))))) is different from true [2024-10-18 00:22:25,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:27,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:29,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:43,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:46,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:48,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:22:51,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:23:18,483 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse20 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse2 (mod (select .cse6 |c_~#value~0.offset|) 4294967296))) (let ((.cse19 (= .cse20 .cse2)) (.cse7 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse15 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse14 (not .cse7)) (.cse0 (not .cse19))) (and (= (select |c_#valid| 3) 1) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse4 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse1 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse4))) (let ((.cse5 (store .cse1 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (let ((.cse3 (select .cse5 |c_~#value~0.base|))) (< (mod (select .cse3 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse4) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse7) (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse8 (store .cse9 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (< 0 (mod (select (select .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (let ((.cse10 (select .cse8 |c_~#value~0.base|))) (< (mod (select .cse10 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse8 |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse11 (store .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (let ((.cse13 (select .cse11 |c_~#value~0.base|))) (< (mod (select .cse13 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse14 (and (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) .cse15)) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (v_DerPreprocessor_34 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse18 (store .cse16 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (let ((.cse17 (select .cse18 |c_~#value~0.base|))) (< (mod (select .cse17 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse18 |c_~#value~0.base| (store .cse17 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse18 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse19) (< .cse20 .cse2) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse2 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse7) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse2 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse14)) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) .cse15) .cse14) (or .cse19 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse22 (store .cse21 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select (select .cse22 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse23 (select .cse22 |c_~#value~0.base|))) (< (mod (select .cse23 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse22 |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse0 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse27 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse24 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse27))) (let ((.cse25 (store .cse24 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse24 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select (select .cse25 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse26 (select .cse25 |c_~#value~0.base|))) (< (mod (select .cse26 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse27) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse26 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse7)))))) is different from false [2024-10-18 00:23:38,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:23:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:23:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-18 00:23:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-18 00:23:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-10-18 00:23:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-18 00:23:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2024-10-18 00:23:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-18 00:23:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:23:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-10-18 00:23:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-18 00:23:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-10-18 00:23:38,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-18 00:23:39,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-18 00:23:39,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 00:23:39,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 00:23:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash -123977085, now seen corresponding path program 2 times [2024-10-18 00:23:39,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 00:23:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784563502] [2024-10-18 00:23:39,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 00:23:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 00:23:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 00:23:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:23:42,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 00:23:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784563502] [2024-10-18 00:23:42,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784563502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 00:23:42,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23934250] [2024-10-18 00:23:42,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 00:23:42,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 00:23:42,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 00:23:42,014 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-18 00:23:42,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-18 00:23:42,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 00:23:42,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 00:23:42,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-18 00:23:42,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 00:23:42,299 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-18 00:23:42,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-18 00:23:42,725 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 35 treesize of output 18 [2024-10-18 00:23:43,412 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-10-18 00:23:43,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-10-18 00:23:43,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-18 00:23:44,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2024-10-18 00:23:44,898 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-18 00:23:44,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-18 00:23:45,978 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-18 00:23:45,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 38 [2024-10-18 00:23:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 00:23:46,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 00:23:48,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse4 (= (mod (select .cse10 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (and (or (and (forall ((v_DerPreprocessor_82 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_82))) (or (< 0 (mod (select (select .cse0 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store (store .cse0 |c_~#value~0.base| v_DerPreprocessor_80) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_81))) (or (= 0 (mod (select (select .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= v_DerPreprocessor_80 (select .cse1 |c_~#value~0.base|))))))))) (or .cse2 (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_prenex_132 Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_82))) (or (= (mod (select (select (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_79) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_132) 4294967296) 0) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse4) (or (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)))) (let ((.cse7 (select .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse5 (store .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) (or (= (mod (select (select (store .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_79) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse2) (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base| v_DerPreprocessor_80) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_81))) (or (not (= (select .cse8 |c_~#value~0.base|) v_DerPreprocessor_80)) (= (mod (select (select .cse8 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select (store .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse9) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))))))) (not .cse4))))) is different from false [2024-10-18 00:23:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 2 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-18 00:23:51,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23934250] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 00:23:51,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 00:23:51,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 13] total 48 [2024-10-18 00:23:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600158464] [2024-10-18 00:23:51,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 00:23:51,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-18 00:23:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 00:23:51,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-18 00:23:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1928, Unknown=51, NotChecked=90, Total=2256 [2024-10-18 00:23:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:23:51,712 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 00:23:51,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 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-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 162 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-10-18 00:23:51,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 00:23:59,239 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse16 (select .cse15 |c_~#value~0.offset|))) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ 1 .cse16))))) (let ((.cse8 (select .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|)) (.cse4 (= (mod .cse16 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (.cse2 (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)))) (and (or (and (forall ((v_DerPreprocessor_82 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_82))) (or (< 0 (mod (select (select .cse0 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store (store .cse0 |c_~#value~0.base| v_DerPreprocessor_80) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_81))) (or (= 0 (mod (select (select .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= v_DerPreprocessor_80 (select .cse1 |c_~#value~0.base|))))))))) (or .cse2 (forall ((v_DerPreprocessor_82 (Array Int Int)) (v_prenex_132 Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_82))) (or (= (mod (select (select (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_79) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_132) 4294967296) 0) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse4) (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| v_DerPreprocessor_80) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_81))) (or (not (= (select .cse5 |c_~#value~0.base|) v_DerPreprocessor_80)) (= (mod (select (select .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select (store .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse7) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse9 (store .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store .cse8 |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) (or (= (mod (select (select (store .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_79) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse2) (or (not .cse4) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))))) (let ((.cse12 (select .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_79 (Array Int Int))) (let ((.cse10 (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store .cse12 |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) (or (< 0 (mod (select (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select (store .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_79) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse2) (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (store .cse12 |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse14 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse13) |c_~#value~0.base| v_DerPreprocessor_80) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_81))) (or (< 0 (mod (select (select (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse13) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= v_DerPreprocessor_80 (select .cse14 |c_~#value~0.base|))) (= (mod (select (select .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))))))))) is different from false [2024-10-18 00:24:22,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:24:45,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:24:52,943 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, 1] [2024-10-18 00:25:00,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:25:02,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:25:48,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:25:50,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:26:17,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:26:19,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:26:26,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse3 (not .cse2)) (.cse4 (select .cse1 |c_~#value~0.offset|))) (and (not (= 3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse0 (mod .cse4 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) .cse3) (not (= (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse4) (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse4 4294967296) 4294967296))))))) is different from false [2024-10-18 00:27:02,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 00:27:24,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 00:27:29,077 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-18 00:27:41,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (let ((.cse10 (not .cse11)) (.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (= (mod (select .cse1 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (.cse3 (or .cse10 (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73))) (or (< 0 (mod (select (select .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= v_DerPreprocessor_72 (select .cse12 |c_~#value~0.base|)))))))) (.cse6 (or .cse11 (forall ((v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_74) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (.cse7 (or (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) .cse11)) (.cse8 (or .cse10 (forall ((v_DerPreprocessor_71 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_914)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (.cse0 (not (= (select |c_#valid| |c_~#value~0.base|) 0)))) (and (or .cse0 (forall ((v_DerPreprocessor_71 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse1 |c_~#value~0.offset| v_ArrVal_914) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (forall ((v_DerPreprocessor_73 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int) (v_ArrVal_910 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_911 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| v_ArrVal_911))) (or (not (= (select .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_910) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_25|) 0)) (not (= (select (store .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0))))) (or (= |c_thr1Thread1of3ForFork0_~#casret~0#1.offset| 0) (not (= |c_~#value~0.base| |c_thr1Thread1of3ForFork0_~#casret~0#1.base|))) .cse3 (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22|) 0)) (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_72) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| v_DerPreprocessor_73) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_22| 1) |c_~#value~0.base|) 0)))) (or .cse4 (and (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_76) |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73))) (or (not (= v_DerPreprocessor_72 (select .cse5 |c_~#value~0.base|))) (< 0 (mod (select (select .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (forall ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (<= 1 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_76) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse6 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_71 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_74) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_914)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_71) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|) 0)) (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|))) .cse7 .cse8 (= 0 |c_~#value~0.offset|) (or (not .cse4) (and .cse3 .cse6 .cse7 .cse8)) (= |c_thr1Thread1of3ForFork0_~vn~0#1| 1) (= |c_thr1Thread1of3ForFork0_~v~0#1| 0) (or .cse0 (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73) |c_~#value~0.base|))) (or (not (= .cse9 v_DerPreprocessor_72)) (< 0 (mod (select .cse9 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_25| Int)) (or (forall ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_72 (Array Int Int)) (v_ArrVal_914 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| v_ArrVal_914)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base| v_DerPreprocessor_72) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_73) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|) 0)) (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_25|))))))) is different from false [2024-10-18 00:27:52,686 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-18 00:27:54,183 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|)) (.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse6 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|))) (let ((.cse7 (= .cse6 1)) (.cse4 (not .cse3)) (.cse0 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse5 (select .cse2 |c_~#value~0.offset|))) (and (not (= 3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (= (select |c_#valid| 3) 1) .cse0 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (or (let ((.cse1 (mod .cse5 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4))) (< 0 (mod .cse6 4294967296)) (< 0 (mod |c_thr1Thread2of3ForFork0_#t~mem6#1| 4294967296))) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (and .cse7 (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1)) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse7 .cse4 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse5) .cse0 (let ((.cse8 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|))) (or (and .cse8 (= 1 .cse5)) (and .cse8 (= 0 .cse5)))))) (not (= (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse5) (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse5 4294967296) 4294967296))))))) is different from false Killed by 15