./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-e94c40d-m [2024-09-22 10:49:36,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-22 10:49:36,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-22 10:49:36,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-22 10:49:36,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-22 10:49:36,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-22 10:49:36,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-22 10:49:36,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-22 10:49:36,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-22 10:49:36,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-22 10:49:36,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-22 10:49:36,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-22 10:49:36,156 INFO L153 SettingsManager]: * Use SBE=true [2024-09-22 10:49:36,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-22 10:49:36,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-22 10:49:36,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-22 10:49:36,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-22 10:49:36,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-22 10:49:36,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-22 10:49:36,159 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-22 10:49:36,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-22 10:49:36,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-22 10:49:36,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-22 10:49:36,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-22 10:49:36,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-22 10:49:36,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-22 10:49:36,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-22 10:49:36,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-22 10:49:36,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-22 10:49:36,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-22 10:49:36,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 10:49:36,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-22 10:49:36,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-22 10:49:36,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-22 10:49:36,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-22 10:49:36,165 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-22 10:49:36,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-22 10:49:36,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-22 10:49:36,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-22 10:49:36,166 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-22 10:49:36,166 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-22 10:49:36,167 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 [2024-09-22 10:49:36,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-22 10:49:36,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-22 10:49:36,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-22 10:49:36,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-22 10:49:36,437 INFO L274 PluginConnector]: CDTParser initialized [2024-09-22 10:49:36,439 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-09-22 10:49:37,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-22 10:49:38,041 INFO L384 CDTParser]: Found 1 translation units. [2024-09-22 10:49:38,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-09-22 10:49:38,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d9cb954c6/567c76ca67784f1cbc568bad93752119/FLAGe142e4481 [2024-09-22 10:49:38,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d9cb954c6/567c76ca67784f1cbc568bad93752119 [2024-09-22 10:49:38,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-22 10:49:38,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-22 10:49:38,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-22 10:49:38,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-22 10:49:38,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-22 10:49:38,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f20cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38, skipping insertion in model container [2024-09-22 10:49:38,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-22 10:49:38,412 WARN L248 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-09-22 10:49:38,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 10:49:38,432 INFO L200 MainTranslator]: Completed pre-run [2024-09-22 10:49:38,469 WARN L248 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-09-22 10:49:38,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-22 10:49:38,511 INFO L204 MainTranslator]: Completed translation [2024-09-22 10:49:38,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38 WrapperNode [2024-09-22 10:49:38,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-22 10:49:38,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-22 10:49:38,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-22 10:49:38,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-22 10:49:38,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,559 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-09-22 10:49:38,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-22 10:49:38,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-22 10:49:38,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-22 10:49:38,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-22 10:49:38,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-22 10:49:38,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-22 10:49:38,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-22 10:49:38,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-22 10:49:38,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (1/1) ... [2024-09-22 10:49:38,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-22 10:49:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:38,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-22 10:49:38,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-22 10:49:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-22 10:49:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-22 10:49:38,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-22 10:49:38,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-22 10:49:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-22 10:49:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-22 10:49:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-22 10:49:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-22 10:49:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-22 10:49:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-22 10:49:38,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-22 10:49:38,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-22 10:49:38,674 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-22 10:49:38,794 INFO L242 CfgBuilder]: Building ICFG [2024-09-22 10:49:38,798 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-22 10:49:38,944 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-22 10:49:38,945 INFO L291 CfgBuilder]: Performing block encoding [2024-09-22 10:49:39,082 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-22 10:49:39,083 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-22 10:49:39,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 10:49:39 BoogieIcfgContainer [2024-09-22 10:49:39,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-22 10:49:39,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-22 10:49:39,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-22 10:49:39,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-22 10:49:39,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 10:49:38" (1/3) ... [2024-09-22 10:49:39,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36830ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 10:49:39, skipping insertion in model container [2024-09-22 10:49:39,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 10:49:38" (2/3) ... [2024-09-22 10:49:39,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36830ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 10:49:39, skipping insertion in model container [2024-09-22 10:49:39,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 10:49:39" (3/3) ... [2024-09-22 10:49:39,091 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-09-22 10:49:39,104 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-22 10:49:39,104 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-22 10:49:39,104 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-22 10:49:39,147 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-22 10:49:39,179 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:39,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 10:49:39,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:39,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-22 10:49:39,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-22 10:49:39,217 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 10:49:39,229 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-22 10:49:39,238 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@221ce497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:39,239 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 10:49:39,341 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:49:39,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-09-22 10:49:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:39,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477624006] [2024-09-22 10:49:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:39,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:39,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477624006] [2024-09-22 10:49:39,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477624006] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:39,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:39,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 10:49:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472449314] [2024-09-22 10:49:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:39,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-22 10:49:39,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-22 10:49:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-22 10:49:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:39,635 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:39,636 INFO L475 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-09-22 10:49:39,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:39,706 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-22 10:49:39,707 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:49:39,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-09-22 10:49:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:39,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127749460] [2024-09-22 10:49:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127749460] [2024-09-22 10:49:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127749460] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-22 10:49:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776232400] [2024-09-22 10:49:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:40,445 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-22 10:49:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:40,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-22 10:49:40,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-22 10:49:40,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:40,448 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:40,449 INFO L475 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-09-22 10:49:40,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:40,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:40,702 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-22 10:49:40,702 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:49:40,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:40,703 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-09-22 10:49:40,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:40,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047195942] [2024-09-22 10:49:40,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:40,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:41,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047195942] [2024-09-22 10:49:41,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047195942] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:49:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796026392] [2024-09-22 10:49:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:41,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:49:41,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:41,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 10:49:41,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-22 10:49:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:41,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-22 10:49:41,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:49:42,021 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 10:49:42,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 10:49:42,120 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-09-22 10:49:42,150 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-09-22 10:49:42,162 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-09-22 10:49:42,592 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-09-22 10:49:44,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:44,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:49:44,989 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_~vn~0#1|)))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-09-22 10:49:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-22 10:49:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796026392] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:49:45,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:49:45,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-09-22 10:49:45,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275644471] [2024-09-22 10:49:45,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:49:45,753 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-22 10:49:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-22 10:49:45,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=689, Unknown=7, NotChecked=56, Total=930 [2024-09-22 10:49:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:45,758 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:45,758 INFO L475 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-09-22 10:49:45,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:45,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:45,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-22 10:49:46,197 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-22 10:49:46,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-22 10:49:46,398 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-09-22 10:49:46,404 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-22 10:49:46,408 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-22 10:49:46,411 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 10:49:46,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:46,414 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-09-22 10:49:46,416 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-09-22 10:49:46,417 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 10:49:46,419 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 10:49:46,419 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@221ce497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:46,420 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 10:49:46,465 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 10:49:46,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-09-22 10:49:46,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:46,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775409857] [2024-09-22 10:49:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:46,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:46,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:46,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775409857] [2024-09-22 10:49:46,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775409857] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:46,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:46,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 10:49:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103488489] [2024-09-22 10:49:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:46,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-22 10:49:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:46,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-22 10:49:46,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-22 10:49:46,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:46,488 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:46,488 INFO L475 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-09-22 10:49:46,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:46,525 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-22 10:49:46,525 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 10:49:46,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-09-22 10:49:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057149470] [2024-09-22 10:49:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:46,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:46,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057149470] [2024-09-22 10:49:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057149470] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-22 10:49:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110366484] [2024-09-22 10:49:46,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:46,925 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-22 10:49:46,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-22 10:49:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-22 10:49:46,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:46,926 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:46,926 INFO L475 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-09-22 10:49:46,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:46,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:47,075 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-22 10:49:47,075 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 10:49:47,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-09-22 10:49:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:47,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89683157] [2024-09-22 10:49:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 10:49:47,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 10:49:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 10:49:47,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 10:49:47,116 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 10:49:47,116 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-22 10:49:47,117 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-22 10:49:47,118 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-22 10:49:47,119 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-22 10:49:47,120 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 10:49:47,120 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-22 10:49:47,135 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-22 10:49:47,137 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:47,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 10:49:47,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:47,139 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-09-22 10:49:47,141 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-09-22 10:49:47,145 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 10:49:47,145 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-22 10:49:47,146 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@221ce497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:47,146 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 10:49:47,226 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 10:49:47,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash -77311195, now seen corresponding path program 1 times [2024-09-22 10:49:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435583321] [2024-09-22 10:49:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:49:47,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:47,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435583321] [2024-09-22 10:49:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435583321] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 10:49:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492540831] [2024-09-22 10:49:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:47,244 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-22 10:49:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-22 10:49:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-22 10:49:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,245 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:47,245 INFO L475 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-09-22 10:49:47,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,328 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-22 10:49:47,328 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 10:49:47,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash 57725467, now seen corresponding path program 1 times [2024-09-22 10:49:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881432627] [2024-09-22 10:49:47,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:49:47,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:47,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881432627] [2024-09-22 10:49:47,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881432627] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:47,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:47,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-22 10:49:47,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062877979] [2024-09-22 10:49:47,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:47,772 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-22 10:49:47,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:47,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-22 10:49:47,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-22 10:49:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,773 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:47,773 INFO L475 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-09-22 10:49:47,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,773 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:47,965 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-22 10:49:47,966 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 10:49:47,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1225995198, now seen corresponding path program 1 times [2024-09-22 10:49:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:47,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161898204] [2024-09-22 10:49:47,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161898204] [2024-09-22 10:49:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161898204] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:49:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851982932] [2024-09-22 10:49:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:48,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:49:48,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:48,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 10:49:48,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-22 10:49:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:48,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-22 10:49:48,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:49:48,760 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-22 10:49:48,760 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-09-22 10:49:48,872 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-09-22 10:49:49,009 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-09-22 10:49:49,100 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 10:49:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 10:49:49,282 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-22 10:49:49,282 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-09-22 10:49:49,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:49,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:49:49,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of2ForFork0_~v~0#1| 1))))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-09-22 10:49:55,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:49:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851982932] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:49:55,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:49:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-09-22 10:49:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747272134] [2024-09-22 10:49:55,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:49:55,942 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-22 10:49:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:55,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-22 10:49:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1060, Unknown=10, NotChecked=68, Total=1332 [2024-09-22 10:49:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:55,945 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:55,946 INFO L475 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-09-22 10:49:55,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:55,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:55,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-22 10:49:56,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-22 10:49:57,120 WARN L456 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-09-22 10:49:57,120 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-22 10:49:57,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1361885377, now seen corresponding path program 1 times [2024-09-22 10:49:57,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:57,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786544593] [2024-09-22 10:49:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 10:49:57,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-22 10:49:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-22 10:49:57,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-22 10:49:57,175 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-22 10:49:57,175 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-22 10:49:57,175 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-22 10:49:57,177 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-22 10:49:57,178 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-22 10:49:57,178 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-22 10:49:57,178 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-22 10:49:57,200 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-22 10:49:57,201 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:57,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-22 10:49:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:57,204 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-09-22 10:49:57,208 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-09-22 10:49:57,210 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-22 10:49:57,210 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-22 10:49:57,210 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@221ce497, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-22 10:49:57,210 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-22 10:49:57,311 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:49:57,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1652438871, now seen corresponding path program 1 times [2024-09-22 10:49:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361412425] [2024-09-22 10:49:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 10:49:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361412425] [2024-09-22 10:49:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361412425] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:57,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-22 10:49:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290232440] [2024-09-22 10:49:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:57,327 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-22 10:49:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-22 10:49:57,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-22 10:49:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:57,328 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:57,328 INFO L475 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-09-22 10:49:57,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:57,433 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-22 10:49:57,433 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:49:57,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash 512081864, now seen corresponding path program 1 times [2024-09-22 10:49:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604299860] [2024-09-22 10:49:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 10:49:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:58,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604299860] [2024-09-22 10:49:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604299860] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:49:58,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-22 10:49:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-22 10:49:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368750664] [2024-09-22 10:49:58,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:49:58,133 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-22 10:49:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:49:58,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-22 10:49:58,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-22 10:49:58,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:58,134 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:49:58,134 INFO L475 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-09-22 10:49:58,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:58,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:58,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:49:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:49:58,446 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-22 10:49:58,446 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:49:58,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:49:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 168074571, now seen corresponding path program 1 times [2024-09-22 10:49:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:49:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907378826] [2024-09-22 10:49:58,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:58,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:49:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:49:59,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:49:59,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907378826] [2024-09-22 10:49:59,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907378826] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:49:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395141796] [2024-09-22 10:49:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:49:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:49:59,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:49:59,212 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 10:49:59,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-22 10:49:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:49:59,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-22 10:49:59,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:49:59,386 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-22 10:49:59,386 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-09-22 10:49:59,525 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-09-22 10:49:59,652 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-09-22 10:49:59,760 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 10:49:59,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 10:49:59,935 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-22 10:49:59,936 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-09-22 10:50:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:50:00,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:50:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:50:06,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395141796] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:50:06,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:50:06,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-09-22 10:50:06,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885763790] [2024-09-22 10:50:06,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:50:06,934 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-22 10:50:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:50:06,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-22 10:50:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1133, Unknown=16, NotChecked=0, Total=1332 [2024-09-22 10:50:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:06,935 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:50:06,936 INFO L475 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-09-22 10:50:06,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:06,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:06,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:08,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-22 10:50:08,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-22 10:50:09,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-22 10:50:09,036 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:50:09,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:50:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2070168268, now seen corresponding path program 1 times [2024-09-22 10:50:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:50:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663885095] [2024-09-22 10:50:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:50:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:50:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:50:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 10:50:09,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:50:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663885095] [2024-09-22 10:50:09,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663885095] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:50:09,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023301985] [2024-09-22 10:50:09,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:50:09,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:50:09,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:50:09,790 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 10:50:09,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-22 10:50:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:50:09,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-22 10:50:09,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:50:09,935 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-09-22 10:50:09,938 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-09-22 10:50:09,941 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-09-22 10:50:09,949 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-09-22 10:50:09,953 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:50:09,954 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-09-22 10:50:09,961 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-09-22 10:50:09,971 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-09-22 10:50:10,113 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-09-22 10:50:10,113 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-09-22 10:50:10,125 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-09-22 10:50:10,201 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-22 10:50:10,202 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-09-22 10:50:10,281 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-09-22 10:50:10,281 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-09-22 10:50:10,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:50:10,291 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-09-22 10:50:10,291 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-09-22 10:50:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 10:50:10,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-22 10:50:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023301985] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:50:10,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-22 10:50:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-09-22 10:50:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445286477] [2024-09-22 10:50:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:50:10,389 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-22 10:50:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:50:10,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-22 10:50:10,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-09-22 10:50:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:10,390 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:50:10,390 INFO L475 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-09-22 10:50:10,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:10,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:10,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-22 10:50:10,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-22 10:50:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:50:13,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-22 10:50:13,339 WARN L456 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-09-22 10:50:13,340 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:50:13,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:50:13,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1428345025, now seen corresponding path program 1 times [2024-09-22 10:50:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:50:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037838821] [2024-09-22 10:50:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:50:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:50:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:50:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:50:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:50:15,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037838821] [2024-09-22 10:50:15,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037838821] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:50:15,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852775193] [2024-09-22 10:50:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:50:15,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:50:15,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:50:15,791 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-22 10:50:15,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-22 10:50:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:50:15,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-22 10:50:15,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:50:15,926 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-22 10:50:15,926 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-09-22 10:50:15,984 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-09-22 10:50:16,010 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-22 10:50:16,010 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-09-22 10:50:16,114 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-09-22 10:50:16,119 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-09-22 10:50:16,221 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-22 10:50:16,221 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-09-22 10:50:16,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:50:16,351 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-09-22 10:50:16,355 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-09-22 10:50:16,361 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-09-22 10:50:16,364 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-09-22 10:50:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:50:16,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:50:17,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:50:17,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 10:50:17,969 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-09-22 10:50:17,985 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 10:50:17,985 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-09-22 10:50:18,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 10:50:18,011 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-09-22 10:50:18,015 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-09-22 10:50:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:50:18,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852775193] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:50:18,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:50:18,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-09-22 10:50:18,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584201460] [2024-09-22 10:50:18,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:50:18,348 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-09-22 10:50:18,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:50:18,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-09-22 10:50:18,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1821, Unknown=19, NotChecked=0, Total=1980 [2024-09-22 10:50:18,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:18,350 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:50:18,350 INFO L475 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-09-22 10:50:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-09-22 10:50:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:50:18,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-22 10:50:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:50:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-22 10:50:22,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-22 10:50:22,670 WARN L456 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-09-22 10:50:22,671 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:50:22,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:50:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2096898662, now seen corresponding path program 2 times [2024-09-22 10:50:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:50:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411292647] [2024-09-22 10:50:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:50:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:50:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:50:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 10:50:23,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:50:23,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411292647] [2024-09-22 10:50:23,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411292647] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:50:23,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794582613] [2024-09-22 10:50:23,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 10:50:23,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:50:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:50:23,631 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-09-22 10:50:23,635 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-09-22 10:50:23,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 10:50:23,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 10:50:23,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-22 10:50:23,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:50:24,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:50:24,041 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-09-22 10:50:24,041 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-09-22 10:50:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-22 10:50:24,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:50:24,696 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-22 10:50:24,697 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-09-22 10:50:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-22 10:50:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794582613] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:50:24,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:50:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 28 [2024-09-22 10:50:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273146654] [2024-09-22 10:50:24,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:50:24,698 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-22 10:50:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:50:24,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-22 10:50:24,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=669, Unknown=2, NotChecked=0, Total=812 [2024-09-22 10:50:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:24,700 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:50:24,700 INFO L475 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-09-22 10:50:24,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:24,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:24,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-22 10:50:24,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:50:24,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-22 10:50:24,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:27,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-22 10:50:33,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-22 10:50:35,410 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-09-22 10:50:35,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-22 10:50:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:50:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-22 10:50:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-22 10:50:35,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-22 10:50:35,973 WARN L456 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-09-22 10:50:35,974 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:50:35,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:50:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1485834762, now seen corresponding path program 1 times [2024-09-22 10:50:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:50:35,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631402470] [2024-09-22 10:50:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:50:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:50:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:50:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:50:37,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:50:37,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631402470] [2024-09-22 10:50:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631402470] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:50:37,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026454335] [2024-09-22 10:50:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:50:37,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:50:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:50:37,187 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-09-22 10:50:37,187 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-09-22 10:50:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:50:37,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-22 10:50:37,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:50:37,342 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-22 10:50:37,342 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-09-22 10:50:37,401 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-09-22 10:50:37,429 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-09-22 10:50:37,429 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-09-22 10:50:37,548 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-22 10:50:37,548 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-09-22 10:50:37,671 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-09-22 10:50:37,677 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-09-22 10:50:37,682 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-09-22 10:50:37,686 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-09-22 10:50:37,691 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-09-22 10:50:37,769 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-09-22 10:50:37,770 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-09-22 10:50:37,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:50:37,860 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-09-22 10:50:37,860 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-09-22 10:50:37,866 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-09-22 10:50:37,914 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-09-22 10:50:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:50:38,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:50:40,403 WARN L854 $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-09-22 10:50:40,453 WARN L854 $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-09-22 10:50:43,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:50:43,350 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-09-22 10:50:43,355 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-09-22 10:50:43,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 10:50:43,364 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-09-22 10:50:43,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 10:50:43,389 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-09-22 10:50:43,433 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-09-22 10:50:43,433 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-09-22 10:50:43,454 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-09-22 10:50:43,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:50:43,460 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-09-22 10:50:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-09-22 10:50:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026454335] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:50:43,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:50:43,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 16] total 44 [2024-09-22 10:50:43,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502879835] [2024-09-22 10:50:43,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:50:43,583 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-22 10:50:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:50:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-22 10:50:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1530, Unknown=17, NotChecked=162, Total=1892 [2024-09-22 10:50:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:43,585 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:50:43,585 INFO L475 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-09-22 10:50:43,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:43,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:50:43,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2024-09-22 10:50:43,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:50:43,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-22 10:50:43,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-22 10:50:43,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:50:47,790 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-09-22 10:50:53,041 WARN L854 $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 (= (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-09-22 10:50:54,479 WARN L854 $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-09-22 10:50:55,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 10:50:58,107 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-09-22 10:51:00,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 10:51:01,979 WARN L854 $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-09-22 10:51:03,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (select .cse5 |c_~#value~0.offset|))) (let ((.cse6 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (mod .cse8 4294967296))) (let ((.cse9 (= .cse6 .cse3))) (let ((.cse0 (not .cse9)) (.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))) (not (= (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse8) (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse8 4294967296) 4294967296)))) (or .cse9 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse11 (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse12 (select .cse11 |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 .cse11 |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))))))) (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 ((.cse16 (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 ((.cse13 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse16))) (let ((.cse14 (store .cse13 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse15 (select .cse14 |c_~#value~0.base|))) (< (mod (select .cse15 |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| .cse16) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse15 |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-09-22 10:51:03,500 WARN L854 $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-09-22 10:51:03,985 WARN L854 $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-09-22 10:51:04,513 WARN L854 $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-09-22 10:51:09,425 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse12 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (mod (select .cse5 |c_~#value~0.offset|) 4294967296))) (let ((.cse13 (= .cse12 .cse3)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse8 (not .cse11)) (.cse0 (not .cse13))) (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))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse6 (select .cse7 |c_~#value~0.base|))) (< (mod (select .cse6 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse7 |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))) (< 0 (mod (select (select .cse7 |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))))) .cse8) (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 ((.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 (store .cse10 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse10 |c_~#value~0.base| (store .cse9 |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 .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)) (= .cse3 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (< .cse12 .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))) .cse11) (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))) .cse8)) (< 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|)) .cse8) (or .cse13 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse15 (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 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))) (< 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 ((.cse20 (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 ((.cse17 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse20))) (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) .cse3) (< 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 (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| .cse20) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse19 |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-09-22 10:51:10,325 WARN L854 $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-09-22 10:51:11,734 WARN L854 $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-09-22 10:51:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:51:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:51:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-22 10:51:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:51:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-22 10:51:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-09-22 10:51:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-09-22 10:51:11,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-22 10:51:12,159 WARN L456 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-09-22 10:51:12,159 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:51:12,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:51:12,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1941037054, now seen corresponding path program 1 times [2024-09-22 10:51:12,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:51:12,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146849445] [2024-09-22 10:51:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:51:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:51:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:51:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:51:13,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:51:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146849445] [2024-09-22 10:51:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146849445] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:51:13,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23461333] [2024-09-22 10:51:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:51:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:51:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:51:13,977 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-09-22 10:51:13,977 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-09-22 10:51:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:51:14,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-22 10:51:14,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:51:14,180 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-22 10:51:14,180 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-09-22 10:51:14,250 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-09-22 10:51:14,273 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-22 10:51:14,274 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-09-22 10:51:14,400 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-22 10:51:14,400 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-09-22 10:51:14,477 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-09-22 10:51:14,481 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-09-22 10:51:14,486 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-09-22 10:51:14,566 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-09-22 10:51:14,620 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-09-22 10:51:15,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:51:15,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:51:15,101 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-09-22 10:51:15,107 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-09-22 10:51:15,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:51:15,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:51:18,783 WARN L854 $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-09-22 10:51:19,265 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-09-22 10:51:19,265 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-09-22 10:51:19,295 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-09-22 10:51:19,295 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-09-22 10:51:20,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:51:20,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:51:20,094 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:51:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 9 refuted. 6 times theorem prover too weak. 2 trivial. 3 not checked. [2024-09-22 10:51:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23461333] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:51:23,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:51:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 15] total 49 [2024-09-22 10:51:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064852002] [2024-09-22 10:51:23,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:51:23,115 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-09-22 10:51:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:51:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-09-22 10:51:23,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2120, Unknown=21, NotChecked=94, Total=2450 [2024-09-22 10:51:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:51:23,117 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:51:23,118 INFO L475 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-09-22 10:51:23,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:51:23,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:51:23,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-09-22 10:51:23,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:51:23,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-22 10:51:23,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-09-22 10:51:23,118 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-09-22 10:51:23,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-09-22 10:52:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-22 10:52:04,958 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-09-22 10:52:05,148 WARN L456 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-09-22 10:52:05,148 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:52:05,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:52:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1350868308, now seen corresponding path program 1 times [2024-09-22 10:52:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:52:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699188046] [2024-09-22 10:52:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:52:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:52:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:52:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:52:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:52:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699188046] [2024-09-22 10:52:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699188046] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:52:08,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949965452] [2024-09-22 10:52:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:52:08,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:52:08,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:52:08,160 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-09-22 10:52:08,161 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-09-22 10:52:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:52:08,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-22 10:52:08,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:52:08,439 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-09-22 10:52:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-22 10:52:08,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-22 10:52:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949965452] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-22 10:52:08,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-22 10:52:08,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2024-09-22 10:52:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785652835] [2024-09-22 10:52:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-22 10:52:08,672 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-22 10:52:08,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:52:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-22 10:52:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-09-22 10:52:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:08,672 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:52:08,673 INFO L475 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-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-22 10:52:08,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:24,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|)) (.cse7 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.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)) (.cse3 (select .cse6 |c_~#value~0.offset|))) (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) (not (= (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse3) (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse3 4294967296) 4294967296))))))) is different from false [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-22 10:52:24,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-22 10:52:24,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-09-22 10:52:24,811 WARN L456 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-09-22 10:52:24,812 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:52:24,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:52:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 972595956, now seen corresponding path program 1 times [2024-09-22 10:52:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:52:24,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985732982] [2024-09-22 10:52:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:52:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:52:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:52:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:52:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:52:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985732982] [2024-09-22 10:52:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985732982] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:52:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689938700] [2024-09-22 10:52:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:52:29,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:52:29,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:52:29,126 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-09-22 10:52:29,127 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-09-22 10:52:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:52:29,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-22 10:52:29,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:52:29,697 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-22 10:52:29,697 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-09-22 10:52:30,324 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-09-22 10:52:30,335 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-09-22 10:52:30,940 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-09-22 10:52:31,493 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-22 10:52:31,493 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-09-22 10:52:32,838 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-22 10:52:32,839 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-09-22 10:52:34,211 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-09-22 10:52:34,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:52:34,269 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-09-22 10:52:34,308 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-09-22 10:52:34,343 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-09-22 10:52:34,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:52:34,831 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-09-22 10:52:34,935 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-09-22 10:52:34,948 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-09-22 10:52:34,971 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-09-22 10:52:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:52:35,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:52:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:52:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689938700] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:52:42,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:52:42,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 13] total 49 [2024-09-22 10:52:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021306495] [2024-09-22 10:52:42,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:52:42,994 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-22 10:52:42,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:52:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-22 10:52:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2149, Unknown=1, NotChecked=0, Total=2352 [2024-09-22 10:52:42,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:42,995 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:52:42,996 INFO L475 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-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-22 10:52:42,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:53:06,524 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-09-22 10:53:10,179 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-09-22 10:53:20,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 10:53:22,804 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-09-22 10:53:24,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 10:53:39,937 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-09-22 10:53:48,680 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-09-22 10:53:51,012 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-09-22 10:54:08,371 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse4 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse6 |c_~#value~0.offset|) 4294967296))) (.cse1 (not (= (select |c_#valid| |c_~#value~0.base|) 0)))) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)))) (or .cse1 .cse0) (or (and (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (store (store .cse2 |c_~#value~0.base| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse2 |c_~#value~0.base| (store (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_28)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) v_prenex_29 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)))) (or .cse1 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_380 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (let ((.cse3 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (store .cse3 |c_~#value~0.base| (store (store (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_380) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse4) (or (not .cse4) (and (or .cse1 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_380 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (let ((.cse5 (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 .cse5 |c_~#value~0.base| (store (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_380) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_380 Int) (v_DerPreprocessor_17 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select (select (let ((.cse8 (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 ((.cse7 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (store (store .cse7 |c_~#value~0.base| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse7 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| v_ArrVal_380)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0))))))))) is different from false [2024-09-22 10:54:10,642 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-09-22 10:54:19,747 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-09-22 10:54:21,976 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-09-22 10:54:51,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse15 (select .cse9 |c_~#value~0.offset|))) (let ((.cse24 (mod .cse15 4294967296))) (let ((.cse4 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse24)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse26 (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1)) (.cse13 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse14 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse12 (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) (or .cse12 (and .cse13 .cse14 (or (= 0 .cse15) (= 1 .cse15)))) (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 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 ((.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)) .cse12) (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 ((.cse23 (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 ((.cse22 (store .cse23 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse22 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse24) (let ((.cse25 (select .cse22 |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 .cse22 |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))))))) (= .cse26 .cse15) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse28 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse27 (select .cse28 |c_~#value~0.base|))) (< (mod (select .cse27 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse28 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse28 |c_~#value~0.base| (store .cse27 |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 .cse28 |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))))) .cse12) (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 ((.cse30 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse29 (select .cse30 |c_~#value~0.base|))) (< (mod (select .cse29 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse30 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse30 |c_~#value~0.base| (store .cse29 |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 .cse30 |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)) (= .cse24 .cse1)) (= |c_thr1Thread2of3ForFork0_~vn~0#1| .cse26) (= |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)) (< .cse24 (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)) (< .cse24 (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))) .cse12)) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)))) (or (and .cse13 (= |c_thr1Thread2of3ForFork0_~v~0#1| 0) .cse14) .cse12) (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 ((.cse31 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse32 (store .cse31 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse31 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse24) (< 0 (mod (select (select .cse32 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse33 (select .cse32 |c_~#value~0.base|))) (< (mod (select .cse33 |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 .cse32 |c_~#value~0.base| (store .cse33 |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 ((.cse37 (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 ((.cse34 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse37))) (let ((.cse35 (store .cse34 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse34 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse24) (< 0 (mod (select (select .cse35 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse36 (select .cse35 |c_~#value~0.base|))) (< (mod (select .cse36 |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| .cse37) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse36 |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-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-22 10:54:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:54:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-22 10:54:59,471 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-09-22 10:54:59,658 WARN L456 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-09-22 10:54:59,658 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:54:59,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:54:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 959485831, now seen corresponding path program 1 times [2024-09-22 10:54:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:54:59,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458069809] [2024-09-22 10:54:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:54:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:54:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:55:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:55:00,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:55:00,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458069809] [2024-09-22 10:55:00,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458069809] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:55:00,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753856152] [2024-09-22 10:55:00,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:55:00,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:55:00,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:55:00,958 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-09-22 10:55:00,959 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-09-22 10:55:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:55:01,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-22 10:55:01,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:55:01,087 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-09-22 10:55:01,206 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-22 10:55:01,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-22 10:55:01,475 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-09-22 10:55:01,496 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-09-22 10:55:01,546 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-09-22 10:55:01,568 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-09-22 10:55:02,043 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-09-22 10:55:02,043 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-09-22 10:55:02,063 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-09-22 10:55:02,258 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-09-22 10:55:02,259 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-09-22 10:55:02,329 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-09-22 10:55:02,412 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-09-22 10:55:02,558 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-09-22 10:55:02,584 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-09-22 10:55:02,633 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-09-22 10:55:02,817 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-09-22 10:55:02,818 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-09-22 10:55:02,854 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-09-22 10:55:03,841 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-09-22 10:55:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:55:03,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:55:04,348 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-09-22 10:55:06,900 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-09-22 10:55:06,900 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-09-22 10:55:06,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-22 10:55:06,948 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-09-22 10:55:06,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:55:06,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-22 10:55:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-22 10:55:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753856152] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:55:07,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:55:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 26 [2024-09-22 10:55:07,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787946287] [2024-09-22 10:55:07,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:55:07,227 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-22 10:55:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:55:07,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-22 10:55:07,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=541, Unknown=7, NotChecked=0, Total=650 [2024-09-22 10:55:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:55:07,228 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:55:07,228 INFO L475 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-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:55:07,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-22 10:55:07,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:55:53,342 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-09-22 10:56:10,128 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-09-22 10:56:14,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (select .cse10 |c_~#value~0.offset|))) (let ((.cse11 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse8 (mod .cse3 4294967296))) (let ((.cse13 (= .cse11 .cse8)) (.cse12 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.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 .cse12)) (.cse5 (not .cse13))) (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) (or .cse5 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (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 ((.cse6 (store .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8) (let ((.cse9 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse9 |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 .cse6 |c_~#value~0.base| (store .cse9 |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))))))) (< .cse11 .cse8) (= |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)) (< .cse8 (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))) .cse12) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse8 (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))) .cse4)) (< 0 (mod .cse0 4294967296))) (or (and .cse1 .cse2) .cse4) (or .cse13 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse15 (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8) (< 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))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse5 (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 ((.cse20 (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 ((.cse17 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse20))) (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) .cse8) (< 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 (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| .cse20) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse19 |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))))))) .cse12))))))) is different from false [2024-09-22 10:56:18,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (select .cse10 |c_~#value~0.offset|)) (.cse19 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse1 (not .cse19)) (.cse8 (mod .cse2 4294967296))) (let ((.cse11 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse8)) (.cse0 (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse8 (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))) .cse19)) (.cse3 (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse8 (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 ((.cse4 (and .cse0 .cse3)) (.cse5 (not .cse11))) (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 (= (select |c_#valid| 3) 1) (or (and (= (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1) .cse2) (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 0)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse4 (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or .cse5 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (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 ((.cse6 (store .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8) (let ((.cse9 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse9 |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 .cse6 |c_~#value~0.base| (store .cse9 |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 .cse4 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or .cse11 (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) .cse8) (< 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 .cse5 (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 ((.cse18 (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 ((.cse15 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse18))) (let ((.cse16 (store .cse15 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse8) (< 0 (mod (select (select .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse17 (select .cse16 |c_~#value~0.base|))) (< (mod (select .cse17 |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| .cse18) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse17 |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))))))) .cse19))))))) is different from false [2024-09-22 10:56:28,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-09-22 10:56:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-22 10:56:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:56:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-09-22 10:56:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-22 10:56:29,381 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-09-22 10:56:29,569 WARN L456 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-09-22 10:56:29,570 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 10:56:29,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 10:56:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash 580232488, now seen corresponding path program 2 times [2024-09-22 10:56:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 10:56:29,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447225744] [2024-09-22 10:56:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 10:56:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 10:56:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 10:56:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:56:42,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 10:56:42,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447225744] [2024-09-22 10:56:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447225744] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 10:56:42,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836088967] [2024-09-22 10:56:42,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 10:56:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 10:56:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 10:56:42,336 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-09-22 10:56:42,337 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-09-22 10:56:42,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 10:56:42,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 10:56:42,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-22 10:56:42,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 10:56:43,052 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-22 10:56:43,052 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-09-22 10:56:43,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-22 10:56:43,967 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-09-22 10:56:43,989 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-09-22 10:56:44,031 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-09-22 10:56:45,236 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-09-22 10:56:45,914 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-22 10:56:45,915 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-09-22 10:56:46,900 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-22 10:56:46,901 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-09-22 10:56:48,025 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-09-22 10:56:48,025 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-09-22 10:56:48,231 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-09-22 10:56:48,231 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-09-22 10:56:48,265 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-09-22 10:56:48,473 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-09-22 10:56:48,473 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-09-22 10:56:49,646 INFO L349 Elim1Store]: treesize reduction 111, result has 25.5 percent of original size [2024-09-22 10:56:49,647 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-09-22 10:56:50,046 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-09-22 10:56:50,046 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-09-22 10:56:51,499 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-09-22 10:56:51,499 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-09-22 10:56:52,875 INFO L349 Elim1Store]: treesize reduction 140, result has 48.0 percent of original size [2024-09-22 10:56:52,875 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-09-22 10:56:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 10:56:54,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 10:56:55,123 WARN L854 $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-09-22 10:56:55,629 WARN L854 $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-09-22 10:56:59,215 WARN L854 $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-09-22 10:56:59,362 WARN L854 $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-09-22 10:56:59,454 WARN L854 $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-09-22 10:57:00,019 WARN L854 $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-09-22 10:57:00,332 WARN L854 $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-09-22 10:57:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 1 refuted. 6 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-22 10:57:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836088967] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 10:57:01,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 10:57:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 14] total 54 [2024-09-22 10:57:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459168698] [2024-09-22 10:57:01,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 10:57:01,208 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-09-22 10:57:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 10:57:01,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-09-22 10:57:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2107, Unknown=14, NotChecked=686, Total=2970 [2024-09-22 10:57:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:57:01,210 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 10:57:01,210 INFO L475 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-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-09-22 10:57:01,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 10:57:27,602 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-09-22 10:57:27,667 WARN L854 $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-09-22 10:57:36,980 WARN L854 $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-09-22 10:58:06,882 WARN L854 $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))) (= (select (select |c_#memory_int| 3) 0) |c_thr1Thread2of3ForFork0_~v~0#1|) (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-09-22 10:59:36,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 10:59:47,346 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-09-22 10:59:56,391 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-09-22 11:00:05,055 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-09-22 11:00:26,465 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-09-22 11:00:28,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 11:00:32,500 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-09-22 11:00:46,734 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-09-22 11:00:48,866 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-09-22 11:00:50,997 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-09-22 11:00:53,731 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-09-22 11:00:55,526 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse1 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse0 (not .cse4))) (and (= (select |c_#valid| 3) 1) (or .cse0 (and (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) .cse1)) (= |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 ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (mod (select .cse3 |c_~#value~0.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 .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))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) .cse1) .cse0)))) is different from false [2024-09-22 11:00:56,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-22 11:00:59,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-09-22 11:01:29,998 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|)) (.cse12 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse29 (not .cse12)) (.cse15 (mod (select .cse10 |c_~#value~0.offset|) 4294967296))) (let ((.cse0 (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse15 (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))) .cse12)) (.cse13 (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse15 (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))) .cse29)) (.cse5 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse15))) (let ((.cse11 (not .cse5)) (.cse2 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse19 (and .cse0 .cse13))) (and .cse0 (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 ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse4 (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (let ((.cse3 (select .cse4 |c_~#value~0.base|))) (< (mod (select .cse3 |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 .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) (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 ((.cse9 (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 ((.cse6 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse7 (store .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select (select .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (< (mod (select .cse8 |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| .cse9) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse8 |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)) .cse12) .cse13 (or .cse11 (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 ((.cse17 (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 ((.cse14 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse17))) (let ((.cse18 (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)) (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse15) (let ((.cse16 (select .cse18 |c_~#value~0.base|))) (< (mod (select .cse16 |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| .cse17) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse16 |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 .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))))))) .cse12) (or .cse19 (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or .cse11 (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 ((.cse21 (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 ((.cse20 (store .cse21 |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 .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse15) (let ((.cse22 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse22 |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 .cse20 |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 (and (or .cse5 (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) .cse2) (< 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 (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 .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 .cse28 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse26 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse27 (select .cse26 |c_~#value~0.base|))) (< (mod (select .cse27 |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 .cse26 |c_~#value~0.base| (store .cse27 |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 .cse28 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse11)) .cse29) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse31 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse30 (select .cse31 |c_~#value~0.base|))) (< (mod (select .cse30 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse31 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse31 |c_~#value~0.base| (store .cse30 |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 .cse31 |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))))) .cse29) (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 ((.cse33 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse32 (select .cse33 |c_~#value~0.base|))) (< (mod (select .cse32 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse33 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse33 |c_~#value~0.base| (store .cse32 |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 .cse33 |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))))) .cse12)) (= .cse15 .cse2)) (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 ((.cse34 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse36 (store .cse34 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (= (mod (select (select .cse34 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse15) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (let ((.cse35 (select .cse36 |c_~#value~0.base|))) (< (mod (select .cse35 |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 .cse36 |c_~#value~0.base| (store .cse35 |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 .cse36 |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) (or .cse19 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296)))))))) is different from false [2024-09-22 11:01:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 11:01:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-22 11:01:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-09-22 11:01:39,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-09-22 11:01:39,691 WARN L456 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-09-22 11:01:39,691 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-22 11:01:39,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-22 11:01:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash 159965983, now seen corresponding path program 2 times [2024-09-22 11:01:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-22 11:01:39,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978238859] [2024-09-22 11:01:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-22 11:01:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-22 11:01:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-22 11:01:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 11:01:45,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-22 11:01:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978238859] [2024-09-22 11:01:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978238859] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-22 11:01:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412449014] [2024-09-22 11:01:45,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-22 11:01:45,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-22 11:01:45,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-22 11:01:45,196 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-09-22 11:01:45,197 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-09-22 11:01:45,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-22 11:01:45,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-22 11:01:45,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-22 11:01:45,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-22 11:01:45,767 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-22 11:01:45,768 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-09-22 11:01:46,856 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-09-22 11:01:48,447 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-09-22 11:01:48,447 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-09-22 11:01:49,055 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-09-22 11:01:50,592 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-09-22 11:01:51,453 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-22 11:01:51,454 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-09-22 11:01:53,277 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-22 11:01:53,277 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-09-22 11:01:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-22 11:01:54,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-22 11:01:56,259 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_80) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_81))) (or (= (mod (select (select .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= v_DerPreprocessor_80 (select .cse0 |c_~#value~0.base|)))))) (or (forall ((v_DerPreprocessor_79 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_79) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)))) is different from false [2024-09-22 11:01:58,137 WARN L854 $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-09-22 11:01:58,448 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (= (mod (select .cse10 |c_~#value~0.offset|) 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) (or (not .cse4) (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 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 (< 0 (mod (select (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (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)))) .cse2) (forall ((v_DerPreprocessor_80 (Array Int Int)) (v_DerPreprocessor_81 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse8 (store .cse7 |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse8) |c_~#value~0.base| v_DerPreprocessor_80) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_81))) (or (< 0 (mod (select (select (store .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= v_DerPreprocessor_80 (select .cse9 |c_~#value~0.base|))) (= (mod (select (select .cse9 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))))))) is different from false [2024-09-22 11:02:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2024-09-22 11:02:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412449014] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-22 11:02:01,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-22 11:02:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 13] total 48 [2024-09-22 11:02:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926146142] [2024-09-22 11:02:01,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-22 11:02:01,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-22 11:02:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-22 11:02:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-22 11:02:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1795, Unknown=19, NotChecked=264, Total=2256 [2024-09-22 11:02:01,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-22 11:02:01,507 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-22 11:02:01,507 INFO L475 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-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 160 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-09-22 11:02:01,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-22 11:02:01,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-09-22 11:02:01,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-22 11:02:12,248 WARN L854 $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-09-22 11:02:36,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse14 (select .cse6 |c_~#value~0.offset|))) (let ((.cse5 (mod .cse14 4294967296))) (let ((.cse16 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse5)) (.cse7 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse8 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|))) (let ((.cse13 (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1)) (.cse15 (= .cse8 1)) (.cse4 (= 1 .cse14)) (.cse3 (= 0 .cse14)) (.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|)) (.cse0 (not .cse7)) (.cse9 (not .cse16))) (and (not (= 3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|)) (or .cse0 (and .cse1 .cse2 (or .cse3 .cse4))) (= (select |c_#valid| 3) 1) (= |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)) (< .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))) .cse0)) (< 0 (mod .cse8 4294967296))) (or .cse9 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse11 (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 ((.cse10 (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse5) (let ((.cse12 (select .cse10 |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 .cse10 |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))))))) (= .cse13 .cse14) (or .cse15 .cse0 (and .cse1 .cse2 .cse3)) (= |c_thr1Thread2of3ForFork0_~vn~0#1| .cse13) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse15 .cse0 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse14) .cse1 (or (and .cse2 .cse4) (and .cse2 .cse3)))) (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)))) (or (and .cse1 (= |c_thr1Thread2of3ForFork0_~v~0#1| 0) .cse2) .cse0) (or .cse16 (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) .cse5) (< 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 .cse9 (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 ((.cse23 (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 ((.cse20 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse23))) (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) .cse5) (< 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 (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| .cse23) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse22 |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 Killed by 15