./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 2cc22fce 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-tmp.fs.goblint-validation-2cc22fc-m [2024-07-22 09:59:15,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-07-22 09:59:16,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-07-22 09:59:16,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-07-22 09:59:16,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-07-22 09:59:16,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-07-22 09:59:16,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-07-22 09:59:16,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-07-22 09:59:16,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-07-22 09:59:16,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-07-22 09:59:16,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-07-22 09:59:16,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-07-22 09:59:16,109 INFO L153 SettingsManager]: * Use SBE=true [2024-07-22 09:59:16,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-07-22 09:59:16,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-07-22 09:59:16,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-07-22 09:59:16,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-07-22 09:59:16,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-07-22 09:59:16,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-07-22 09:59:16,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-07-22 09:59:16,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-07-22 09:59:16,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-07-22 09:59:16,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-07-22 09:59:16,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-07-22 09:59:16,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-07-22 09:59:16,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-07-22 09:59:16,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-07-22 09:59:16,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-07-22 09:59:16,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-07-22 09:59:16,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-07-22 09:59:16,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-22 09:59:16,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-07-22 09:59:16,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-07-22 09:59:16,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-07-22 09:59:16,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-07-22 09:59:16,118 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-07-22 09:59:16,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-07-22 09:59:16,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-07-22 09:59:16,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-07-22 09:59:16,118 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-07-22 09:59:16,119 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-07-22 09:59:16,119 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-07-22 09:59:16,119 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-07-22 09:59:16,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-07-22 09:59:16,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-07-22 09:59:16,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-07-22 09:59:16,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-07-22 09:59:16,388 INFO L274 PluginConnector]: CDTParser initialized [2024-07-22 09:59:16,389 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-07-22 09:59:17,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-07-22 09:59:17,769 INFO L384 CDTParser]: Found 1 translation units. [2024-07-22 09:59:17,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-07-22 09:59:17,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f03d7f817/ca82f45d3f4941a4b54e4748946afef7/FLAG559fcb4fa [2024-07-22 09:59:17,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f03d7f817/ca82f45d3f4941a4b54e4748946afef7 [2024-07-22 09:59:17,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-07-22 09:59:17,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-07-22 09:59:17,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-07-22 09:59:17,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-07-22 09:59:17,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-07-22 09:59:17,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:59:17" (1/1) ... [2024-07-22 09:59:17,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e4284c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:17, skipping insertion in model container [2024-07-22 09:59:17,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 09:59:17" (1/1) ... [2024-07-22 09:59:17,841 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-07-22 09:59:18,161 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-07-22 09:59:18,177 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-22 09:59:18,184 INFO L202 MainTranslator]: Completed pre-run [2024-07-22 09:59:18,226 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-07-22 09:59:18,231 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-22 09:59:18,267 INFO L206 MainTranslator]: Completed translation [2024-07-22 09:59:18,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18 WrapperNode [2024-07-22 09:59:18,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-07-22 09:59:18,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-07-22 09:59:18,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-07-22 09:59:18,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-07-22 09:59:18,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,317 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-07-22 09:59:18,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-07-22 09:59:18,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-07-22 09:59:18,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-07-22 09:59:18,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-07-22 09:59:18,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-07-22 09:59:18,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-07-22 09:59:18,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-07-22 09:59:18,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-07-22 09:59:18,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (1/1) ... [2024-07-22 09:59:18,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-22 09:59:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:18,427 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-07-22 09:59:18,434 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-07-22 09:59:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-07-22 09:59:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-07-22 09:59:18,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-07-22 09:59:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-07-22 09:59:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-07-22 09:59:18,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-07-22 09:59:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-07-22 09:59:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-07-22 09:59:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-07-22 09:59:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-07-22 09:59:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-07-22 09:59:18,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-07-22 09:59:18,505 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-07-22 09:59:18,663 INFO L244 CfgBuilder]: Building ICFG [2024-07-22 09:59:18,665 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-07-22 09:59:18,785 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-07-22 09:59:18,785 INFO L293 CfgBuilder]: Performing block encoding [2024-07-22 09:59:18,855 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-07-22 09:59:18,855 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-07-22 09:59:18,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:59:18 BoogieIcfgContainer [2024-07-22 09:59:18,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-07-22 09:59:18,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-07-22 09:59:18,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-07-22 09:59:18,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-07-22 09:59:18,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 09:59:17" (1/3) ... [2024-07-22 09:59:18,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358d7e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:59:18, skipping insertion in model container [2024-07-22 09:59:18,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 09:59:18" (2/3) ... [2024-07-22 09:59:18,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358d7e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 09:59:18, skipping insertion in model container [2024-07-22 09:59:18,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 09:59:18" (3/3) ... [2024-07-22 09:59:18,865 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-07-22 09:59:18,871 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-07-22 09:59:18,879 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-07-22 09:59:18,879 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-07-22 09:59:18,879 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-07-22 09:59:18,912 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-22 09:59:18,942 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:18,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-22 09:59:18,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:18,969 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-07-22 09:59:19,001 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-07-22 09:59:19,042 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-22 09:59:19,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-07-22 09:59:19,066 INFO L357 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, mHoare=true, 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;@7d6a4ab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:19,067 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-22 09:59:19,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:19,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:19,182 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-07-22 09:59:19,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317061913] [2024-07-22 09:59:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317061913] [2024-07-22 09:59:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317061913] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-07-22 09:59:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989803281] [2024-07-22 09:59:19,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:19,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-07-22 09:59:19,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-07-22 09:59:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-07-22 09:59:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:19,379 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:19,379 INFO L496 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-07-22 09:59:19,380 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:19,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-07-22 09:59:19,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:19,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-07-22 09:59:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:19,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283749923] [2024-07-22 09:59:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:20,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283749923] [2024-07-22 09:59:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283749923] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:20,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-07-22 09:59:20,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111469405] [2024-07-22 09:59:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:20,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-22 09:59:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-22 09:59:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-07-22 09:59:20,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:20,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:20,025 INFO L496 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-07-22 09:59:20,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:20,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:20,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-07-22 09:59:20,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:20,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-07-22 09:59:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929769891] [2024-07-22 09:59:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929769891] [2024-07-22 09:59:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929769891] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 09:59:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042388116] [2024-07-22 09:59:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:21,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 09:59:21,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:21,080 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-07-22 09:59:21,081 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-07-22 09:59:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:21,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjunts are in the unsatisfiable core [2024-07-22 09:59:21,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 09:59:21,224 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-22 09:59:21,225 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-07-22 09:59:21,281 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-07-22 09:59:21,296 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-07-22 09:59:21,302 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-07-22 09:59:21,633 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-07-22 09:59:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:23,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 09:59:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:24,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042388116] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 09:59:24,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 09:59:24,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-07-22 09:59:24,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757100287] [2024-07-22 09:59:24,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 09:59:24,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-07-22 09:59:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-07-22 09:59:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=734, Unknown=14, NotChecked=0, Total=930 [2024-07-22 09:59:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:24,598 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:24,598 INFO L496 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-07-22 09:59:24,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:24,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:24,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-07-22 09:59:24,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-07-22 09:59:24,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-07-22 09:59:25,070 WARN L477 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-07-22 09:59:25,074 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-07-22 09:59:25,076 INFO L308 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-07-22 09:59:25,077 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:25,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-22 09:59:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:25,079 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-07-22 09:59:25,082 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-22 09:59:25,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-22 09:59:25,083 INFO L357 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, mHoare=true, 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;@7d6a4ab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:25,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-22 09:59:25,104 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-07-22 09:59:25,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-22 09:59:25,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-07-22 09:59:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131610644] [2024-07-22 09:59:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:25,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131610644] [2024-07-22 09:59:25,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131610644] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:25,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:25,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-07-22 09:59:25,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282225028] [2024-07-22 09:59:25,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:25,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-07-22 09:59:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-07-22 09:59:25,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-07-22 09:59:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,134 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:25,134 INFO L496 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-07-22 09:59:25,134 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-07-22 09:59:25,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-22 09:59:25,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-07-22 09:59:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134926661] [2024-07-22 09:59:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:25,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:25,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:25,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134926661] [2024-07-22 09:59:25,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134926661] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:25,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:25,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-07-22 09:59:25,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253654234] [2024-07-22 09:59:25,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:25,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-22 09:59:25,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:25,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-22 09:59:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-07-22 09:59:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:25,394 INFO L496 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-07-22 09:59:25,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:25,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-07-22 09:59:25,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-22 09:59:25,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:25,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-07-22 09:59:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:25,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960045215] [2024-07-22 09:59:25,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:25,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-22 09:59:25,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-22 09:59:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-22 09:59:25,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-22 09:59:25,529 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-22 09:59:25,530 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-07-22 09:59:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-07-22 09:59:25,531 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-07-22 09:59:25,531 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-07-22 09:59:25,532 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-07-22 09:59:25,532 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-07-22 09:59:25,544 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-22 09:59:25,546 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:25,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-22 09:59:25,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:25,548 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-07-22 09:59:25,553 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-22 09:59:25,553 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-22 09:59:25,553 INFO L357 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, mHoare=true, 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;@7d6a4ab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:25,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-22 09:59:25,569 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-07-22 09:59:25,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-22 09:59:25,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -77311195, now seen corresponding path program 1 times [2024-07-22 09:59:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713323415] [2024-07-22 09:59:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 09:59:25,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713323415] [2024-07-22 09:59:25,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713323415] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:25,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:25,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-07-22 09:59:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135199299] [2024-07-22 09:59:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:25,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-07-22 09:59:25,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:25,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-07-22 09:59:25,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-07-22 09:59:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:25,621 INFO L496 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-07-22 09:59:25,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:25,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-07-22 09:59:25,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-22 09:59:25,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash 57725467, now seen corresponding path program 1 times [2024-07-22 09:59:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:25,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299170091] [2024-07-22 09:59:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 09:59:26,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:26,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299170091] [2024-07-22 09:59:26,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299170091] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:26,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:26,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-07-22 09:59:26,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511433849] [2024-07-22 09:59:26,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:26,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-22 09:59:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:26,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-22 09:59:26,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-07-22 09:59:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:26,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:26,003 INFO L496 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-07-22 09:59:26,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:26,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:26,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-07-22 09:59:26,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-22 09:59:26,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:26,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1225995198, now seen corresponding path program 1 times [2024-07-22 09:59:26,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:26,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518857913] [2024-07-22 09:59:26,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:26,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518857913] [2024-07-22 09:59:26,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518857913] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 09:59:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274375394] [2024-07-22 09:59:26,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:26,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 09:59:26,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:26,562 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-07-22 09:59:26,585 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-07-22 09:59:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:26,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjunts are in the unsatisfiable core [2024-07-22 09:59:26,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 09:59:26,681 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-22 09:59:26,682 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-07-22 09:59:26,773 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-07-22 09:59:26,901 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-07-22 09:59:26,969 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-22 09:59:26,970 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-07-22 09:59:27,109 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-07-22 09:59:27,110 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-07-22 09:59:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:27,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 09:59:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:37,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274375394] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 09:59:37,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 09:59:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-07-22 09:59:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160957395] [2024-07-22 09:59:37,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 09:59:37,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-07-22 09:59:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-07-22 09:59:37,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1118, Unknown=16, NotChecked=0, Total=1332 [2024-07-22 09:59:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:37,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:37,199 INFO L496 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-07-22 09:59:37,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:37,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:37,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-07-22 09:59:38,064 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-07-22 09:59:38,251 WARN L477 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-07-22 09:59:38,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-22 09:59:38,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1361885377, now seen corresponding path program 1 times [2024-07-22 09:59:38,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:38,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970384689] [2024-07-22 09:59:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:38,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-22 09:59:38,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-22 09:59:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-22 09:59:38,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-22 09:59:38,293 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-22 09:59:38,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-07-22 09:59:38,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-07-22 09:59:38,294 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-07-22 09:59:38,295 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-07-22 09:59:38,295 WARN L234 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-07-22 09:59:38,295 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-07-22 09:59:38,316 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-22 09:59:38,318 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:38,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-22 09:59:38,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:38,320 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-07-22 09:59:38,321 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-07-22 09:59:38,323 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-22 09:59:38,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-07-22 09:59:38,323 INFO L357 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, mHoare=true, 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;@7d6a4ab8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 09:59:38,323 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-07-22 09:59:38,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:38,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1652438871, now seen corresponding path program 1 times [2024-07-22 09:59:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326878096] [2024-07-22 09:59:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-22 09:59:38,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:38,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326878096] [2024-07-22 09:59:38,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326878096] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:38,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:38,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-07-22 09:59:38,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233321200] [2024-07-22 09:59:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:38,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-07-22 09:59:38,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:38,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-07-22 09:59:38,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-07-22 09:59:38,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:38,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:38,450 INFO L496 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-07-22 09:59:38,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:38,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-07-22 09:59:38,531 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:38,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash 512081864, now seen corresponding path program 1 times [2024-07-22 09:59:38,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446589049] [2024-07-22 09:59:38,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-22 09:59:39,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446589049] [2024-07-22 09:59:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446589049] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:39,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 09:59:39,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-07-22 09:59:39,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167140885] [2024-07-22 09:59:39,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:39,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-07-22 09:59:39,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-07-22 09:59:39,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-07-22 09:59:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:39,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:39,077 INFO L496 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-07-22 09:59:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:39,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:39,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-07-22 09:59:39,323 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:39,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 168074571, now seen corresponding path program 1 times [2024-07-22 09:59:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891402486] [2024-07-22 09:59:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 09:59:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891402486] [2024-07-22 09:59:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891402486] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 09:59:39,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348530837] [2024-07-22 09:59:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:39,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 09:59:39,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:39,931 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-07-22 09:59:39,958 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-07-22 09:59:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:40,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjunts are in the unsatisfiable core [2024-07-22 09:59:40,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 09:59:40,094 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-22 09:59:40,095 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-07-22 09:59:40,205 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-07-22 09:59:40,330 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-07-22 09:59:40,406 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-22 09:59:40,406 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-07-22 09:59:40,544 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-07-22 09:59:40,545 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-07-22 09:59:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:40,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 09:59:40,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (not .cse0) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse1 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-07-22 09:59:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:50,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348530837] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 09:59:50,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 09:59:50,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-07-22 09:59:50,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168881958] [2024-07-22 09:59:50,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 09:59:50,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-07-22 09:59:50,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:50,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-07-22 09:59:50,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1076, Unknown=9, NotChecked=68, Total=1332 [2024-07-22 09:59:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:50,130 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:50,131 INFO L496 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-07-22 09:59:50,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:50,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:50,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-07-22 09:59:51,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-07-22 09:59:52,137 WARN L477 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-07-22 09:59:52,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:52,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2070168268, now seen corresponding path program 1 times [2024-07-22 09:59:52,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237563971] [2024-07-22 09:59:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-07-22 09:59:52,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:52,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237563971] [2024-07-22 09:59:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237563971] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 09:59:52,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819040124] [2024-07-22 09:59:52,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:52,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 09:59:52,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:52,703 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-07-22 09:59:52,740 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-07-22 09:59:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:52,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2024-07-22 09:59:52,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 09:59:52,846 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-07-22 09:59:52,849 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-07-22 09:59:52,850 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-07-22 09:59:52,857 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-07-22 09:59:52,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-22 09:59:52,861 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-07-22 09:59:52,865 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-07-22 09:59:52,875 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-07-22 09:59:53,009 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-07-22 09:59:53,009 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-07-22 09:59:53,019 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-07-22 09:59:53,069 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-07-22 09:59:53,071 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-07-22 09:59:53,129 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-07-22 09:59:53,129 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-07-22 09:59:53,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 09:59:53,136 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-07-22 09:59:53,137 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-07-22 09:59:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-22 09:59:53,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-22 09:59:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819040124] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 09:59:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-07-22 09:59:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-07-22 09:59:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826425650] [2024-07-22 09:59:53,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 09:59:53,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-22 09:59:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 09:59:53,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-22 09:59:53,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-07-22 09:59:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:53,249 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 09:59:53,249 INFO L496 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-07-22 09:59:53,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:53,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:53,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-07-22 09:59:53,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 09:59:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 09:59:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-07-22 09:59:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-22 09:59:55,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-07-22 09:59:56,146 WARN L477 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-07-22 09:59:56,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 09:59:56,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 09:59:56,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1428345025, now seen corresponding path program 1 times [2024-07-22 09:59:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 09:59:56,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032425932] [2024-07-22 09:59:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 09:59:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 09:59:58,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 09:59:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032425932] [2024-07-22 09:59:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032425932] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 09:59:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528390546] [2024-07-22 09:59:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 09:59:58,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 09:59:58,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 09:59:58,192 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-07-22 09:59:58,214 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-07-22 09:59:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 09:59:58,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2024-07-22 09:59:58,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 09:59:58,346 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-22 09:59:58,346 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-07-22 09:59:58,423 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-07-22 09:59:58,444 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-07-22 09:59:58,445 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-07-22 09:59:58,538 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-07-22 09:59:58,542 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-07-22 09:59:58,616 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-07-22 09:59:58,617 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-07-22 09:59:58,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 09:59:58,757 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-07-22 09:59:58,760 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-07-22 09:59:58,764 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-07-22 09:59:58,767 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-07-22 09:59:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 09:59:58,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 10:00:00,173 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-22 10:00:00,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-22 10:00:00,181 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-07-22 10:00:00,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-22 10:00:00,194 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-07-22 10:00:00,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-22 10:00:00,216 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-07-22 10:00:00,220 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-07-22 10:00:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 10:00:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528390546] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 10:00:00,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 10:00:00,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-07-22 10:00:00,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334789681] [2024-07-22 10:00:00,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 10:00:00,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-07-22 10:00:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 10:00:00,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-07-22 10:00:00,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1824, Unknown=15, NotChecked=0, Total=1980 [2024-07-22 10:00:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:00,581 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 10:00:00,581 INFO L496 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-07-22 10:00:00,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:00,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:00:00,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-07-22 10:00:00,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:00:00,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:00:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-07-22 10:00:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:00:04,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-07-22 10:00:04,632 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-07-22 10:00:04,816 WARN L477 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-07-22 10:00:04,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 10:00:04,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 10:00:04,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2096898662, now seen corresponding path program 2 times [2024-07-22 10:00:04,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 10:00:04,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141527420] [2024-07-22 10:00:04,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 10:00:04,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 10:00:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 10:00:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-07-22 10:00:05,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 10:00:05,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141527420] [2024-07-22 10:00:05,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141527420] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 10:00:05,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23079745] [2024-07-22 10:00:05,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-07-22 10:00:05,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 10:00:05,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 10:00:05,561 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-07-22 10:00:05,572 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-07-22 10:00:05,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-07-22 10:00:05,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-22 10:00:05,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjunts are in the unsatisfiable core [2024-07-22 10:00:05,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 10:00:05,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 10:00:05,910 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-07-22 10:00:05,910 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-07-22 10:00:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-07-22 10:00:06,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 10:00:06,585 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-07-22 10:00:06,585 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-07-22 10:00:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-07-22 10:00:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23079745] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 10:00:06,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 10:00:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 28 [2024-07-22 10:00:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787469848] [2024-07-22 10:00:06,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 10:00:06,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-07-22 10:00:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 10:00:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-07-22 10:00:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=669, Unknown=2, NotChecked=0, Total=812 [2024-07-22 10:00:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:06,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 10:00:06,587 INFO L496 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-07-22 10:00:06,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:06,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:00:06,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-07-22 10:00:06,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:00:06,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-07-22 10:00:06,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:09,787 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-07-22 10:00:12,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-07-22 10:00:13,310 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1)) (.cse11 (select .cse12 0)) (.cse1 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (let ((.cse7 (select .cse12 |c_~#value~0.offset|)) (.cse0 (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse3 (not .cse1)) (.cse4 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse2 (= .cse6 .cse11)) (.cse8 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (and (<= |c_thr1Thread3of3ForFork0_~v~0#1| (+ (* .cse0 4294967296) 4294967294)) (or .cse1 .cse2) (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 1) (or .cse3 (and .cse4 (let ((.cse5 (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|))) (or (= .cse5 1) (= .cse5 0))))) (or .cse3 (and .cse4 (or (= |c_thr1Thread2of3ForFork0_#t~mem6#1| 0) (= |c_thr1Thread2of3ForFork0_#t~mem6#1| 1)))) (<= .cse6 .cse7) (<= (div .cse7 4294967296) .cse0) (or .cse3 (< .cse8 1)) (= |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 0) (= 0 |c_~#value~0.offset|) (or (exists ((v_DerPreprocessor_24 (Array Int Int))) (and (exists ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|))) (and (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse9 0)) (= v_DerPreprocessor_23 .cse9)))) (= (select v_DerPreprocessor_24 0) 0))) (and (exists ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= (select v_DerPreprocessor_24 0) 0) (= v_DerPreprocessor_23 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|)))) .cse1)) (or .cse3 (and .cse4 (= |c_thr1Thread3of3ForFork0_~v~0#1| 0))) (= .cse6 |c_thr1Thread3of3ForFork0_~vn~0#1|) (not (= 4294967295 .cse8)) (let ((.cse10 (<= .cse8 0))) (or (and (or (and (exists ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= |c_thr1Thread3of3ForFork0_~v~0#1| (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|) 0)) (= (select (select |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 1) (= (select v_DerPreprocessor_24 0) 0))) .cse10) (exists ((v_DerPreprocessor_24 (Array Int Int))) (and (exists ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_23 (Array Int Int))) (and (= |c_thr1Thread3of3ForFork0_~v~0#1| (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|) 0)) (= (select (select |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 1))) (= (select v_DerPreprocessor_24 0) 0)))) .cse2) (and (= .cse11 1) .cse10))))))) is different from true [2024-07-22 10:00:17,207 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-07-22 10:00:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:00:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-07-22 10:00:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:00:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-07-22 10:00:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-07-22 10:00:17,559 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-07-22 10:00:17,746 WARN L477 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-07-22 10:00:17,746 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 10:00:17,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 10:00:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1485834762, now seen corresponding path program 1 times [2024-07-22 10:00:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 10:00:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614749831] [2024-07-22 10:00:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 10:00:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 10:00:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 10:00:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 10:00:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 10:00:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614749831] [2024-07-22 10:00:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614749831] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 10:00:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347861970] [2024-07-22 10:00:18,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 10:00:18,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 10:00:18,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 10:00:18,706 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-07-22 10:00:18,707 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-07-22 10:00:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 10:00:18,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2024-07-22 10:00:18,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 10:00:18,868 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-22 10:00:18,869 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-07-22 10:00:18,931 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-07-22 10:00:18,969 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-07-22 10:00:18,969 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-07-22 10:00:19,093 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-07-22 10:00:19,094 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-07-22 10:00:19,190 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-07-22 10:00:19,195 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-07-22 10:00:19,199 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-07-22 10:00:19,202 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-07-22 10:00:19,206 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-07-22 10:00:19,270 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-07-22 10:00:19,270 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-07-22 10:00:19,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 10:00:19,340 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-07-22 10:00:19,341 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-07-22 10:00:19,345 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-07-22 10:00:19,383 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-07-22 10:00:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 10:00:19,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 10:00:21,805 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-07-22 10:00:22,727 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|)) (.cse0 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse10 (not .cse0)) (.cse2 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse11 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse6 |c_~#value~0.offset|) 4294967296)))) (and (or (and (or .cse0 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (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|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse3 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_34) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse5))) (let ((.cse1 (store .cse3 |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)) (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (let ((.cse4 (select .cse1 |c_~#value~0.base|))) (< (mod (select .cse4 |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| .cse5) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse4 |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)))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_subst_30 Int)) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse7 (store .cse9 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 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 |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| v_subst_30)) |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 .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) (not .cse11)) (or (and (or .cse0 (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_35 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse12 (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse12 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse13 (select .cse12 |c_~#value~0.base|))) (< (mod (select .cse13 |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 .cse12 |c_~#value~0.base| (store .cse13 |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))) (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse10 (forall ((v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_subst_30 Int)) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse15 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_prenex_51))) (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_prenex_51) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse15 |c_~#value~0.base| (store .cse16 |c_~#value~0.offset| v_subst_30)) |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) .cse2) (< 0 (mod (select v_prenex_51 v_prenex_52) 4294967296)))))))) .cse11)))) is different from false [2024-07-22 10:00:24,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-22 10:00:24,570 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 3347 treesize of output 2754 [2024-07-22 10:00:24,580 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-07-22 10:00:24,583 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 26 treesize of output 22 [2024-07-22 10:00:24,607 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-07-22 10:00:24,607 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-07-22 10:00:24,626 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-22 10:00:24,629 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-07-22 10:00:24,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-22 10:00:24,637 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-07-22 10:00:24,643 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-07-22 10:00:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 3 times theorem prover too weak. 2 trivial. 2 not checked. [2024-07-22 10:00:24,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347861970] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 10:00:24,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 10:00:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 16] total 44 [2024-07-22 10:00:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000246275] [2024-07-22 10:00:24,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 10:00:24,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-07-22 10:00:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 10:00:24,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-07-22 10:00:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1527, Unknown=17, NotChecked=162, Total=1892 [2024-07-22 10:00:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:24,710 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 10:00:24,710 INFO L496 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-07-22 10:00:24,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:24,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:00:24,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-07-22 10:00:24,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:00:24,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-07-22 10:00:24,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-07-22 10:00:24,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:33,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (mod (select .cse11 |c_~#value~0.offset|) 4294967296)) (.cse10 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse7 (not .cse10)) (.cse0 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse2))) (and (or .cse0 (forall ((v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_subst_30 Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse3 (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_prenex_51))) (or (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse4 (select .cse3 |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_prenex_51) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_subst_30)) |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_prenex_51 v_prenex_52) 4294967296))))))) (= (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 ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse5 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse5 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse6 |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))) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse7) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse8 (select .cse9 |c_~#value~0.base|))) (< (mod (select .cse8 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse9 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse9 |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 (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse10)) (= .cse2 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .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 .cse11 |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))) .cse10) (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 .cse11 |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)) (< 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|)) .cse7) (or (not .cse0) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse15 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |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_34) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15))) (let ((.cse13 (store .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= .cse2 (mod (select (select .cse12 |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)) (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))))))) .cse10) (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_subst_30 Int)) (let ((.cse18 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse16 (store .cse18 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse17 (select .cse16 |c_~#value~0.base|))) (< (mod (select .cse17 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse16 |c_~#value~0.base| (store .cse17 |c_~#value~0.offset| v_subst_30)) |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 .cse18 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))))))) is different from false [2024-07-22 10:00:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:00:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:00:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-07-22 10:00:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:00:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-07-22 10:00:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-07-22 10:00:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-07-22 10:00:39,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-07-22 10:00:39,831 WARN L477 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-07-22 10:00:39,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 10:00:39,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 10:00:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash 413263169, now seen corresponding path program 1 times [2024-07-22 10:00:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 10:00:39,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125009949] [2024-07-22 10:00:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 10:00:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 10:00:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 10:00:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-07-22 10:00:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 10:00:40,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125009949] [2024-07-22 10:00:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125009949] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 10:00:40,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447808089] [2024-07-22 10:00:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 10:00:40,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 10:00:40,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 10:00:40,364 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-07-22 10:00:40,368 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-07-22 10:00:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 10:00:40,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 57 conjunts are in the unsatisfiable core [2024-07-22 10:00:40,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 10:00:40,567 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-22 10:00:40,568 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-07-22 10:00:40,682 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-07-22 10:00:40,824 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-07-22 10:00:40,906 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-22 10:00:40,906 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-07-22 10:00:41,148 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-07-22 10:00:41,148 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-07-22 10:00:41,262 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 0 case distinctions, treesize of input 31 treesize of output 29 [2024-07-22 10:00:41,277 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-07-22 10:00:41,278 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 1 case distinctions, treesize of input 23 treesize of output 25 [2024-07-22 10:00:41,360 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 16 treesize of output 11 [2024-07-22 10:00:41,487 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 24 treesize of output 19 [2024-07-22 10:00:41,490 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 16 treesize of output 11 [2024-07-22 10:00:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 10:00:41,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 10:00:41,767 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_37 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse0 |c_~#value~0.offset| (+ 1 (select .cse0 |c_~#value~0.offset|))))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))) is different from false [2024-07-22 10:00:41,865 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))) (.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (or .cse0 (forall ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (+ (select .cse2 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (or (not .cse0) (forall ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2024-07-22 10:00:41,896 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))) (.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (or .cse0 (forall ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (+ (select .cse2 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (or (not .cse0) (forall ((v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse3 |c_~#value~0.offset| (+ (select .cse3 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2024-07-22 10:01:03,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse19 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse19 |c_~#value~0.offset| (+ 1 (select .cse19 |c_~#value~0.offset|))))))) (let ((.cse9 (select .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|))) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| Int) (v_ArrVal_606 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse0 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_606))) (or (not (= (select .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18|) 0)) (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_ArrVal_607 Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store .cse9 |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (select (store .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7)) (.cse6 (select .cse5 |c_~#value~0.offset|))) (let ((.cse1 (mod .cse6 4294967296)) (.cse2 (store (store .cse3 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ .cse6 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| v_DerPreprocessor_43))) (or (not (= (select (store .cse0 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| v_ArrVal_607) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0)) (= .cse1 (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store (store (store .cse3 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| v_DerPreprocessor_43) |c_~#value~0.base| (let ((.cse4 (select (store .cse2 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse4 |c_~#value~0.offset| (+ (select .cse4 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| Int) (v_ArrVal_606 Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_606))) (or (not (= (select .cse10 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18|) 0)) (forall ((v_DerPreprocessor_41 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_ArrVal_607 Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse18 (store .cse9 |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse16 (select (store .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse18) |c_~#value~0.base|))) (let ((.cse17 (select .cse16 |c_~#value~0.offset|))) (let ((.cse15 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse18)) (.cse14 (+ .cse17 1)) (.cse11 (mod .cse17 4294967296))) (or (not (= (select (store .cse10 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| v_ArrVal_607) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0)) (< .cse11 (mod (select (select (store (let ((.cse12 (store .cse15 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| v_DerPreprocessor_41))) (store .cse12 |c_~#value~0.base| (let ((.cse13 (select (store (store .cse12 |c_~#value~0.base| (store v_DerPreprocessor_41 |c_~#value~0.offset| .cse14)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse13 |c_~#value~0.offset| (+ (select .cse13 |c_~#value~0.offset|) 1))))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (mod (select (select (store (store .cse15 |c_~#value~0.base| (store .cse16 |c_~#value~0.offset| .cse14)) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_18| v_DerPreprocessor_41) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11)))))))))))))) is different from false [2024-07-22 10:01:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 1 refuted. 6 times theorem prover too weak. 0 trivial. 13 not checked. [2024-07-22 10:01:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447808089] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 10:01:13,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 10:01:13,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 22] total 51 [2024-07-22 10:01:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605407682] [2024-07-22 10:01:13,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 10:01:13,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-07-22 10:01:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 10:01:13,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-07-22 10:01:13,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1964, Unknown=51, NotChecked=380, Total=2652 [2024-07-22 10:01:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:01:13,077 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 10:01:13,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.230769230769231) internal successors, (116), 51 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-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-07-22 10:01:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:01:24,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:27,530 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-07-22 10:01:30,085 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-07-22 10:01:32,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:35,055 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-07-22 10:01:37,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:39,379 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-07-22 10:01:40,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:42,989 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-07-22 10:01:45,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:47,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:49,417 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-07-22 10:01:51,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:53,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:55,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:57,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:01:59,509 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-07-22 10:02:01,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:03,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:05,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:07,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:19,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:22,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:23,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:26,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:27,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:28,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:30,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:33,018 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-07-22 10:02:34,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:02:39,626 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-07-22 10:02:41,650 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-07-22 10:02:43,674 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-07-22 10:02:45,721 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-07-22 10:02:47,760 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-07-22 10:02:49,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:02,463 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-07-22 10:03:04,487 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-07-22 10:03:06,521 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-07-22 10:03:08,551 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-07-22 10:03:10,969 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-07-22 10:03:12,985 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-07-22 10:03:14,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:17,115 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-07-22 10:03:19,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:21,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:23,520 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-07-22 10:03:25,589 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-07-22 10:03:44,482 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-07-22 10:03:46,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:47,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:49,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:51,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:53,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:55,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:03:57,947 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-07-22 10:03:59,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-07-22 10:04:02,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:04,051 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-07-22 10:04:06,081 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-07-22 10:04:08,173 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-07-22 10:04:10,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:12,231 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-07-22 10:04:14,306 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-07-22 10:04:16,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:18,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:20,753 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-07-22 10:04:22,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:24,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:26,950 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-07-22 10:04:28,969 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-07-22 10:04:31,006 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-07-22 10:04:33,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:35,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:36,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:36,580 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse43 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse44 (select .cse43 |c_~#value~0.offset|))) (let ((.cse6 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse0 (mod .cse44 4294967296))) (let ((.cse3 (+ 1 .cse44)) (.cse9 (= .cse6 .cse0))) (let ((.cse14 (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1)) (.cse15 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse9)) (.cse16 (store |c_#memory_int| |c_~#value~0.base| (store .cse43 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|))) (.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse43 |c_~#value~0.offset| .cse3)))) (and (forall ((v_DerPreprocessor_41 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< .cse0 (mod (select (select (store (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41))) (store .cse1 |c_~#value~0.base| (let ((.cse2 (select (store (store .cse1 |c_~#value~0.base| (store v_DerPreprocessor_41 |c_~#value~0.offset| .cse3)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (+ (select .cse2 |c_~#value~0.offset|) 1))))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= .cse0 (mod (select (select (store .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0)))) (or (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_40))) (let ((.cse5 (select .cse7 |c_~#value~0.base|))) (or (not (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse0)) (< .cse6 (mod (select (select (store (store .cse7 |c_~#value~0.base| (let ((.cse8 (select (store (store .cse7 |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| .cse3)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse8 |c_~#value~0.offset| (+ (select .cse8 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) .cse9) (or .cse10 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (select (store .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41) |c_~#value~0.base|))) (or (< .cse6 (mod (select (select (store (let ((.cse11 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41))) (store .cse11 |c_~#value~0.base| (let ((.cse12 (select (store (store .cse11 |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| .cse14)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse12 |c_~#value~0.offset| (+ (select .cse12 |c_~#value~0.offset|) 1))))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= .cse15 (mod (select .cse13 |c_~#value~0.offset|) 4294967296))) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) (or .cse9 (forall ((v_DerPreprocessor_42 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_42))) (or (< .cse6 (mod (select (select (store (store .cse17 |c_~#value~0.base| (let ((.cse18 (select (store .cse17 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse18 |c_~#value~0.offset| (+ (select .cse18 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0)))))) (or .cse9 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_42))) (or (< .cse6 (mod (select (select (store (store .cse19 |c_~#value~0.base| (let ((.cse20 (select (store .cse19 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse20 |c_~#value~0.offset| (+ (select .cse20 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse15))))) (or .cse10 (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (store .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43))) (or (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= .cse0 (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse6 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#value~0.base| (let ((.cse22 (select (store .cse21 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse22 |c_~#value~0.offset| (+ (select .cse22 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (= |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (or .cse9 (forall ((v_DerPreprocessor_40 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse24 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_40))) (let ((.cse23 (select .cse24 |c_~#value~0.base|))) (or (not (= (mod (select .cse23 |c_~#value~0.offset|) 4294967296) .cse0)) (< .cse6 (mod (select (select (store (store .cse24 |c_~#value~0.base| (let ((.cse25 (select (store (store .cse24 |c_~#value~0.base| (store .cse23 |c_~#value~0.offset| .cse3)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse25 |c_~#value~0.offset| (+ (select .cse25 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0))))))) (or .cse10 (forall ((v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse26 (store .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43))) (or (= .cse15 (mod (select (select .cse26 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse6 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#value~0.base| (let ((.cse27 (select (store .cse26 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse27 |c_~#value~0.offset| (+ (select .cse27 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (= 0 |c_~#value~0.offset|) (or (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse28 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_42))) (or (< .cse6 (mod (select (select (store (store .cse28 |c_~#value~0.base| (let ((.cse29 (select (store .cse28 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse29 |c_~#value~0.offset| (+ (select .cse29 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= (mod (select (select .cse28 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0)))) .cse9) (or .cse9 (forall ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse30 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_40))) (let ((.cse32 (select .cse30 |c_~#value~0.base|))) (or (< .cse6 (mod (select (select (store (store .cse30 |c_~#value~0.base| (let ((.cse31 (select (store (store .cse30 |c_~#value~0.base| (store .cse32 |c_~#value~0.offset| .cse14)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse31 |c_~#value~0.offset| (+ (select .cse31 |c_~#value~0.offset|) 1)))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select .cse32 |c_~#value~0.offset|) 4294967296) .cse15)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))) (or .cse10 (forall ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse35 (select (store .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41) |c_~#value~0.base|))) (or (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse6 (mod (select (select (store (let ((.cse33 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41))) (store .cse33 |c_~#value~0.base| (let ((.cse34 (select (store (store .cse33 |c_~#value~0.base| (store .cse35 |c_~#value~0.offset| .cse3)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse34 |c_~#value~0.offset| (+ (select .cse34 |c_~#value~0.offset|) 1))))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= .cse0 (mod (select .cse35 |c_~#value~0.offset|) 4294967296))))))) (or .cse10 (forall ((v_DerPreprocessor_41 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse36 (select (store .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41) |c_~#value~0.base|))) (or (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= .cse0 (mod (select .cse36 |c_~#value~0.offset|) 4294967296))) (< .cse6 (mod (select (select (store (let ((.cse37 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_41))) (store .cse37 |c_~#value~0.base| (let ((.cse38 (select (store (store .cse37 |c_~#value~0.base| (store .cse36 |c_~#value~0.offset| .cse3)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_38) |c_~#value~0.base|))) (store .cse38 |c_~#value~0.offset| (+ (select .cse38 |c_~#value~0.offset|) 1))))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0)))))) (or .cse10 (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse39 (store .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43))) (or (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= .cse0 (mod (select (select .cse39 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0)) (< .cse6 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#value~0.base| (let ((.cse40 (select (store .cse39 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse40 |c_~#value~0.offset| (+ (select .cse40 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (forall ((v_DerPreprocessor_43 (Array Int Int)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| Int) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse42 (store .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43))) (or (< .cse0 (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_43) |c_~#value~0.base| (let ((.cse41 (select (store .cse42 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_39) |c_~#value~0.base|))) (store .cse41 |c_~#value~0.offset| (+ (select .cse41 |c_~#value~0.offset|) 1)))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (= .cse0 (mod (select (select .cse42 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_19|) 0))))))))))) is different from false [2024-07-22 10:04:38,625 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-07-22 10:04:40,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:42,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:44,692 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-07-22 10:04:46,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:48,762 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-07-22 10:04:50,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:53,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:04:55,027 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-07-22 10:04:57,115 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-07-22 10:04:59,563 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-07-22 10:05:01,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:24,550 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-07-22 10:05:26,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:28,582 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-07-22 10:05:30,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:32,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:34,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:36,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:38,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:40,740 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-07-22 10:05:42,906 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-07-22 10:05:44,928 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-07-22 10:05:47,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:49,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:51,234 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-07-22 10:05:53,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:05:55,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:05,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:22,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:23,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:25,707 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-07-22 10:07:27,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:29,514 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-07-22 10:07:30,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:33,280 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-07-22 10:07:37,567 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-07-22 10:07:40,216 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-07-22 10:07:42,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:44,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:07:46,310 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-07-22 10:08:24,541 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-07-22 10:08:26,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:08:28,788 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-07-22 10:08:31,008 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-07-22 10:08:34,889 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-07-22 10:08:36,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-07-22 10:08:42,217 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-07-22 10:08:49,824 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-07-22 10:08:52,144 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-07-22 10:08:53,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:08:55,874 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-07-22 10:08:57,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:09:42,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:10:25,675 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-07-22 10:10:50,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:10:52,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:10:54,829 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-07-22 10:10:56,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:10:58,867 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-07-22 10:10:59,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:11:01,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:11:03,816 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-07-22 10:11:14,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:11:16,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:11:20,998 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (select .cse2 |c_~#value~0.offset|))) (let ((.cse7 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (.cse8 (mod .cse5 4294967296))) (let ((.cse0 (not (= .cse8 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (.cse3 (not .cse7)) (.cse4 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse6 (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1)) (.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (= (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296) 0) (or .cse0 (forall ((v_DerPreprocessor_37 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (or .cse3 (and .cse4 (= 0 .cse5))) (or .cse0 (forall ((v_DerPreprocessor_37 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| .cse6)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_37) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_37 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (= 0 |c_~#value~0.offset|) (or .cse3 (and .cse4 (= |c_thr1Thread3of3ForFork0_~v~0#1| 0))) (or .cse7 (and (<= |c_thr1Thread3of3ForFork0_~v~0#1| (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) 4294967294)) (<= |c_thr1Thread3of3ForFork0_~vn~0#1| .cse6))) (or .cse7 (< |c_thr1Thread3of3ForFork0_~v~0#1| |c_thr1Thread3of3ForFork0_~vn~0#1|)) (or (< .cse1 .cse8) (= (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) is different from false [2024-07-22 10:11:23,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:11:26,138 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-07-22 10:11:29,441 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse9 (select .cse4 0)) (.cse0 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (let ((.cse2 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) 0)) (.cse5 (not .cse0)) (.cse1 (= (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1) .cse9)) (.cse6 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (and (or .cse0 .cse1) (= |c_thr1Thread3of3ForFork0_#t~mem6#1| .cse2) (= .cse2 1) (or (let ((.cse3 (select .cse4 |c_~#value~0.offset|))) (and (= |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|) (or (= 1 .cse3) (= |c_thr1Thread3of3ForFork0_#t~mem6#1| 0)) (= |c_thr1Thread3of3ForFork0_#t~mem6#1| .cse3))) .cse5) (= |c_thr1Thread3of3ForFork0_#t~mem6#1| 1) (or .cse5 (< .cse6 1)) (= |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 0) (= 0 |c_~#value~0.offset|) (or (exists ((v_DerPreprocessor_24 (Array Int Int))) (and (exists ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|))) (and (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse7 0)) (= v_DerPreprocessor_23 .cse7)))) (= (select v_DerPreprocessor_24 0) 0))) (and (exists ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= (select v_DerPreprocessor_24 0) 0) (= v_DerPreprocessor_23 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|)))) .cse0)) (not (= 4294967295 .cse6)) (let ((.cse8 (<= .cse6 0))) (or (and (or (and (exists ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= |c_thr1Thread3of3ForFork0_~v~0#1| (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|) 0)) (= (select (select |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 1) (= (select v_DerPreprocessor_24 0) 0))) .cse8) (exists ((v_DerPreprocessor_24 (Array Int Int))) (and (exists ((|thr1Thread3of3ForFork0_~#casret~0#1.base| Int) (v_DerPreprocessor_23 (Array Int Int))) (and (= |c_thr1Thread3of3ForFork0_~v~0#1| (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_23) |thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_24) |c_~#value~0.base|) 0)) (= (select (select |c_#memory_int| |thr1Thread3of3ForFork0_~#casret~0#1.base|) 0) 1))) (= (select v_DerPreprocessor_24 0) 0)))) .cse1) (and (= .cse9 1) .cse8))))))) is different from true [2024-07-22 10:11:34,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:11:36,431 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))) (and (< (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse0) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2)))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) is different from false [2024-07-22 10:11:39,245 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296))) (let ((.cse7 (= .cse8 .cse0)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse3 (not (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0)))) (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)) (or .cse3 .cse2) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_prenex_51 (Array Int Int)) (v_prenex_52 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_subst_30 Int)) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_35))) (let ((.cse5 (store .cse6 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_prenex_51))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (let ((.cse4 (select .cse5 |c_~#value~0.base|))) (< (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_prenex_51) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse5 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_subst_30)) |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 .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (< 0 (mod (select (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_prenex_51 v_prenex_52) 4294967296)))))) .cse7) (or (= (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse8 .cse0)) (or (not .cse7) (and (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_subst_30 Int)) (let ((.cse10 (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)))) (let ((.cse9 (store .cse10 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| 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) .cse0) (let ((.cse11 (select .cse9 |c_~#value~0.base|))) (< (mod (select .cse11 |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 .cse9 |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| v_subst_30)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse15 (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))) (let ((.cse12 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_34) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15))) (let ((.cse13 (store .cse12 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (= .cse0 (mod (select (select .cse12 |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)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (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| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse2))) (or .cse3 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)))))) is different from false [2024-07-22 10:11:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:11:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:11:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-07-22 10:11:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:11:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-07-22 10:11:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-07-22 10:11:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-07-22 10:11:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-07-22 10:11:40,365 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-07-22 10:11:40,551 WARN L477 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-07-22 10:11:40,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-07-22 10:11:40,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 10:11:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1941037054, now seen corresponding path program 1 times [2024-07-22 10:11:40,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 10:11:40,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365120149] [2024-07-22 10:11:40,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 10:11:40,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 10:11:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 10:11:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 10:11:44,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 10:11:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365120149] [2024-07-22 10:11:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365120149] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-22 10:11:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451638892] [2024-07-22 10:11:44,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 10:11:44,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 10:11:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 10:11:44,941 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-07-22 10:11:44,942 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-07-22 10:11:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 10:11:45,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 36 conjunts are in the unsatisfiable core [2024-07-22 10:11:45,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 10:11:45,216 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-07-22 10:11:45,217 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-07-22 10:11:45,378 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-07-22 10:11:45,435 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-07-22 10:11:45,435 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-07-22 10:11:45,742 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-07-22 10:11:45,742 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-07-22 10:11:46,045 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-07-22 10:11:46,061 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-07-22 10:11:46,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 10:11:46,274 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 63 treesize of output 122 [2024-07-22 10:11:46,285 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 25 treesize of output 22 [2024-07-22 10:11:46,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 10:11:46,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 10:11:46,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-07-22 10:11:46,346 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 44 treesize of output 57 [2024-07-22 10:11:55,200 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 41 treesize of output 59 [2024-07-22 10:11:55,212 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-07-22 10:11:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 10 refuted. 2 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 10:11:55,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 10:11:59,194 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (.cse8 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse6 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse8 |c_~#value~0.offset|) 4294967296))) (.cse0 (not .cse5)) (.cse2 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (and (or (and (or .cse0 (forall ((v_prenex_112 Int) (v_prenex_68 Int) (v_prenex_111 Int) (v_prenex_110 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_57))) (or (< 0 (mod (select (select (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_prenex_110) |c_~#value~0.base| (store v_prenex_110 |c_~#value~0.offset| v_prenex_68)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_112 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) v_prenex_111) 4294967296)) (< 0 (mod (select v_prenex_110 v_prenex_112) 4294967296)) (= (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2))))) (or (forall ((v_DerPreprocessor_54 (Array Int Int)) (v_ArrVal_704 Int) (v_DerPreprocessor_55 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_57))) (let ((.cse4 (select .cse3 |c_~#value~0.base|))) (or (< 0 (mod (select (select (store (store .cse3 |c_~#value~0.base| v_DerPreprocessor_54) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse3 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_ArrVal_704)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_55 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select .cse4 |c_~#value~0.offset|) 4294967296) .cse2))))) .cse5)) .cse6) (or (not .cse6) (let ((.cse12 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse9 (not .cse12))) (and (or .cse0 (forall ((v_prenex_68 Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_55 (Array Int 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 .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (or (< 0 (mod (select v_DerPreprocessor_55 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse2) (< 0 (mod (select (select (store .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#value~0.base| (store v_DerPreprocessor_55 |c_~#value~0.offset| v_prenex_68)) |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 (and (or (forall ((v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_704 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_55 (Array Int 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 .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse11 (select .cse10 |c_~#value~0.base|))) (or (< 0 (mod (select (select (store (store .cse10 |c_~#value~0.base| v_DerPreprocessor_54) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#value~0.base| (store .cse11 |c_~#value~0.offset| v_ArrVal_704)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_55 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select .cse11 |c_~#value~0.offset|) 4294967296) .cse2))))) .cse9) (or .cse12 (forall ((v_DerPreprocessor_54 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_704 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse15 (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|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse13 (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_56) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15) |c_~#value~0.base|))) (or (= .cse2 (mod (select .cse13 |c_~#value~0.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_55 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse15))) (store (store .cse14 |c_~#value~0.base| v_DerPreprocessor_54) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| v_ArrVal_704)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))) .cse5)))))))) is different from false [2024-07-22 10:12:01,317 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-07-22 10:12:01,318 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-07-22 10:12:03,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-22 10:12:03,058 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 55 treesize of output 51 [2024-07-22 10:12:03,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-22 10:12:03,079 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 76 treesize of output 72 [2024-07-22 10:12:03,093 INFO L173 IndexEqualityManager]: detected equality via solver [2024-07-22 10:12:03,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-22 10:12:03,100 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 72 [2024-07-22 10:12:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 15 refuted. 3 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 10:12:04,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451638892] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 10:12:04,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-22 10:12:04,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 16] total 53 [2024-07-22 10:12:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133770053] [2024-07-22 10:12:04,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-22 10:12:04,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-07-22 10:12:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 10:12:04,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-07-22 10:12:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2484, Unknown=47, NotChecked=102, Total=2862 [2024-07-22 10:12:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:12:04,215 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 10:12:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 53 states have internal predecessors, (120), 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-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2024-07-22 10:12:04,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 10:12:24,242 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-07-22 10:12:27,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:12:29,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:12:31,480 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-07-22 10:12:47,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 16.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:12:50,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:12:53,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:12:54,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-07-22 10:12:57,026 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-07-22 10:12:59,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15