./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 4a4c57e3 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-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 19:28:43,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 19:28:43,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 19:28:43,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 19:28:43,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 19:28:43,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 19:28:43,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 19:28:43,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 19:28:43,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 19:28:43,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 19:28:43,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 19:28:43,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 19:28:43,335 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 19:28:43,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 19:28:43,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 19:28:43,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 19:28:43,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 19:28:43,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 19:28:43,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 19:28:43,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 19:28:43,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 19:28:43,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 19:28:43,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 19:28:43,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 19:28:43,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 19:28:43,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 19:28:43,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 19:28:43,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 19:28:43,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 19:28:43,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 19:28:43,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 19:28:43,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 19:28:43,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 19:28:43,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 19:28:43,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 19:28:43,340 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 19:28:43,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 19:28:43,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 19:28:43,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 19:28:43,341 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 19:28:43,341 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 19:28:43,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2024-09-08 19:28:43,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 19:28:43,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 19:28:43,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 19:28:43,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 19:28:43,662 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 19:28:43,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-09-08 19:28:45,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 19:28:45,319 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 19:28:45,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-09-08 19:28:45,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/41647a7b2/51f7bd45b8b34c1f95b4b4bde3120658/FLAG667204b6e [2024-09-08 19:28:45,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/41647a7b2/51f7bd45b8b34c1f95b4b4bde3120658 [2024-09-08 19:28:45,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 19:28:45,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-08 19:28:45,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 19:28:45,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 19:28:45,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 19:28:45,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f10be72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45, skipping insertion in model container [2024-09-08 19:28:45,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 19:28:45,722 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-09-08 19:28:45,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 19:28:45,745 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 19:28:45,804 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-09-08 19:28:45,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 19:28:45,859 INFO L204 MainTranslator]: Completed translation [2024-09-08 19:28:45,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45 WrapperNode [2024-09-08 19:28:45,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 19:28:45,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 19:28:45,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 19:28:45,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 19:28:45,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,902 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-09-08 19:28:45,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 19:28:45,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 19:28:45,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 19:28:45,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 19:28:45,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 19:28:45,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 19:28:45,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 19:28:45,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 19:28:45,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (1/1) ... [2024-09-08 19:28:45,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 19:28:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:28:45,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 19:28:45,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 19:28:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-08 19:28:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 19:28:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 19:28:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-08 19:28:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 19:28:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 19:28:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 19:28:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 19:28:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 19:28:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 19:28:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 19:28:46,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 19:28:46,039 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 19:28:46,254 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 19:28:46,260 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 19:28:46,431 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 19:28:46,431 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 19:28:46,561 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 19:28:46,561 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-08 19:28:46,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:28:46 BoogieIcfgContainer [2024-09-08 19:28:46,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 19:28:46,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 19:28:46,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 19:28:46,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 19:28:46,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:28:45" (1/3) ... [2024-09-08 19:28:46,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc65092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:28:46, skipping insertion in model container [2024-09-08 19:28:46,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:28:45" (2/3) ... [2024-09-08 19:28:46,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc65092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:28:46, skipping insertion in model container [2024-09-08 19:28:46,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:28:46" (3/3) ... [2024-09-08 19:28:46,568 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-09-08 19:28:46,584 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 19:28:46,584 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-08 19:28:46,584 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 19:28:46,621 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:28:46,655 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:28:46,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:28:46,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:28:46,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:28:46,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 19:28:46,697 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:28:46,708 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 19:28:46,712 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dc8d7d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:28:46,712 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:28:46,803 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:28:46,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-09-08 19:28:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:46,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275798257] [2024-09-08 19:28:46,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:46,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:46,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:46,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275798257] [2024-09-08 19:28:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275798257] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:28:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:28:46,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:28:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783049177] [2024-09-08 19:28:46,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:28:46,997 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:28:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:28:47,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:28:47,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:28:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:47,024 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:28:47,025 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:28:47,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:47,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:47,085 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 19:28:47,085 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:28:47,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-09-08 19:28:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39733500] [2024-09-08 19:28:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39733500] [2024-09-08 19:28:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39733500] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:28:47,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:28:47,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 19:28:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897378173] [2024-09-08 19:28:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:28:47,962 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:28:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:28:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:28:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-08 19:28:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:47,965 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:28:47,965 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:28:47,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:47,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:28:48,230 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 19:28:48,230 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:28:48,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-09-08 19:28:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411611526] [2024-09-08 19:28:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:49,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411611526] [2024-09-08 19:28:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411611526] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:28:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344714797] [2024-09-08 19:28:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:49,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:28:49,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:28:49,327 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:28:49,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-08 19:28:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:49,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-08 19:28:49,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:28:49,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 19:28:49,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 19:28:49,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 106 [2024-09-08 19:28:49,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-09-08 19:28:49,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2024-09-08 19:28:50,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2024-09-08 19:28:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:52,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:28:52,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_~vn~0#1|)))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-09-08 19:28:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-08 19:28:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344714797] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:28:53,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:28:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-09-08 19:28:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475671342] [2024-09-08 19:28:53,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:28:53,424 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-08 19:28:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:28:53,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-08 19:28:53,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=685, Unknown=11, NotChecked=56, Total=930 [2024-09-08 19:28:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:53,427 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:28:53,427 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:28:53,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:53,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:28:53,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:28:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 19:28:53,960 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-08 19:28:53,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-08 19:28:54,165 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-09-08 19:28:54,175 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-08 19:28:54,179 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-08 19:28:54,183 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:28:54,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:28:54,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:28:54,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:28:54,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-09-08 19:28:54,190 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:28:54,191 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 19:28:54,192 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dc8d7d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:28:54,194 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:28:54,240 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:28:54,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-09-08 19:28:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:54,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930137375] [2024-09-08 19:28:54,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:54,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930137375] [2024-09-08 19:28:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930137375] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:28:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:28:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:28:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568591380] [2024-09-08 19:28:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:28:54,260 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:28:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:28:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:28:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:28:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:54,261 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:28:54,262 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:28:54,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:54,305 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 19:28:54,305 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:28:54,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-09-08 19:28:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856986685] [2024-09-08 19:28:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:54,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856986685] [2024-09-08 19:28:54,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856986685] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:28:54,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:28:54,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-08 19:28:54,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569748686] [2024-09-08 19:28:54,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:28:54,702 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:28:54,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:28:54,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:28:54,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-08 19:28:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:54,703 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:28:54,703 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:28:54,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:54,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:54,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:28:54,848 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 19:28:54,848 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:28:54,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-09-08 19:28:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721262766] [2024-09-08 19:28:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:28:54,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 19:28:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:28:54,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 19:28:54,887 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 19:28:54,888 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 19:28:54,888 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 19:28:54,889 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-08 19:28:54,890 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 19:28:54,890 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 19:28:54,890 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 19:28:54,908 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:28:54,911 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:28:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:28:54,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:28:54,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:28:54,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-09-08 19:28:54,916 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:28:54,917 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 19:28:54,917 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dc8d7d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:28:54,917 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:28:55,001 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:28:55,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash -77311195, now seen corresponding path program 1 times [2024-09-08 19:28:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:55,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526112463] [2024-09-08 19:28:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:28:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526112463] [2024-09-08 19:28:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526112463] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:28:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:28:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:28:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553144319] [2024-09-08 19:28:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:28:55,015 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:28:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:28:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:28:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:28:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:55,017 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:28:55,017 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:28:55,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:55,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 19:28:55,078 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:28:55,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 57725467, now seen corresponding path program 1 times [2024-09-08 19:28:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963605820] [2024-09-08 19:28:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:28:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:55,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963605820] [2024-09-08 19:28:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963605820] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:28:55,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:28:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-08 19:28:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440458873] [2024-09-08 19:28:55,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:28:55,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:28:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:28:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:28:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-08 19:28:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:55,529 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:28:55,530 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:28:55,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:55,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:55,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:28:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:28:55,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 19:28:55,724 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:28:55,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:28:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1225995198, now seen corresponding path program 1 times [2024-09-08 19:28:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:28:55,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513396391] [2024-09-08 19:28:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:28:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:28:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513396391] [2024-09-08 19:28:56,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513396391] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:28:56,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68423881] [2024-09-08 19:28:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:28:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:28:56,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:28:56,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:28:56,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-08 19:28:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:28:56,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-08 19:28:56,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:28:56,520 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 19:28:56,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 19:28:56,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-09-08 19:28:56,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-09-08 19:28:56,876 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 19:28:56,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 19:28:57,061 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-08 19:28:57,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-09-08 19:28:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:28:57,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:28:57,287 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_~vn~0#1|)))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-09-08 19:29:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:29:03,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68423881] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:29:03,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:29:03,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-09-08 19:29:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576837539] [2024-09-08 19:29:03,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:29:03,276 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-08 19:29:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-08 19:29:03,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1059, Unknown=10, NotChecked=68, Total=1332 [2024-09-08 19:29:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:03,278 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:03,279 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:03,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:03,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:03,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:04,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 19:29:04,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-08 19:29:04,421 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-08 19:29:04,422 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:29:04,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:04,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1361885377, now seen corresponding path program 1 times [2024-09-08 19:29:04,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521282695] [2024-09-08 19:29:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:29:04,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 19:29:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:29:04,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 19:29:04,472 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 19:29:04,473 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 19:29:04,473 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-08 19:29:04,474 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 19:29:04,475 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 19:29:04,475 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 19:29:04,475 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 19:29:04,498 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:29:04,500 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:29:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:29:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:29:04,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:29:04,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-09-08 19:29:04,508 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:29:04,508 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 19:29:04,509 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dc8d7d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:29:04,509 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:29:04,625 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:29:04,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1652438871, now seen corresponding path program 1 times [2024-09-08 19:29:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:04,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110837555] [2024-09-08 19:29:04,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:04,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:29:04,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:29:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110837555] [2024-09-08 19:29:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110837555] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:29:04,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:29:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:29:04,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271981895] [2024-09-08 19:29:04,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:29:04,640 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:29:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:04,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:29:04,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:29:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:04,641 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:04,641 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:04,641 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:04,730 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-08 19:29:04,730 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:29:04,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash 512081864, now seen corresponding path program 1 times [2024-09-08 19:29:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:04,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562913855] [2024-09-08 19:29:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:29:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:29:05,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562913855] [2024-09-08 19:29:05,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562913855] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:29:05,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:29:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-08 19:29:05,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656689653] [2024-09-08 19:29:05,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:29:05,435 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 19:29:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:05,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 19:29:05,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-09-08 19:29:05,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:05,435 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:05,436 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:05,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:05,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:05,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:05,765 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-08 19:29:05,766 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:29:05,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash 168074571, now seen corresponding path program 1 times [2024-09-08 19:29:05,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177621115] [2024-09-08 19:29:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:29:06,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:29:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177621115] [2024-09-08 19:29:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177621115] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:29:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463319601] [2024-09-08 19:29:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:06,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:29:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:29:06,483 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:29:06,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-08 19:29:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:06,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-08 19:29:06,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:29:06,668 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 19:29:06,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 19:29:06,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-09-08 19:29:06,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-09-08 19:29:07,107 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 19:29:07,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-08 19:29:07,308 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-09-08 19:29:07,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-09-08 19:29:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:29:07,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:29:07,560 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 (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_~vn~0#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)))) (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))))))) is different from false [2024-09-08 19:29:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:29:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463319601] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:29:13,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:29:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-09-08 19:29:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993426033] [2024-09-08 19:29:13,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:29:13,364 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-08 19:29:13,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:13,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-08 19:29:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1072, Unknown=12, NotChecked=68, Total=1332 [2024-09-08 19:29:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:13,365 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:13,365 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:13,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:13,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:13,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-08 19:29:15,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-08 19:29:15,501 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-08 19:29:15,501 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:29:15,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2070168268, now seen corresponding path program 1 times [2024-09-08 19:29:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:15,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795216263] [2024-09-08 19:29:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 19:29:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:29:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795216263] [2024-09-08 19:29:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795216263] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:29:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284015572] [2024-09-08 19:29:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:16,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:29:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:29:16,221 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:29:16,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-08 19:29:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:16,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-08 19:29:16,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:29:16,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 19:29:16,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-08 19:29:16,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:29:16,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-09-08 19:29:16,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:29:16,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-08 19:29:16,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:29:16,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-08 19:29:16,541 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-09-08 19:29:16,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2024-09-08 19:29:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 19:29:16,624 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 19:29:16,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-09-08 19:29:16,698 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-09-08 19:29:16,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2024-09-08 19:29:16,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:29:16,710 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-09-08 19:29:16,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2024-09-08 19:29:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:29:16,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:29:16,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284015572] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:29:16,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-08 19:29:16,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-09-08 19:29:16,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819733245] [2024-09-08 19:29:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:29:16,806 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:29:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:29:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-09-08 19:29:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:16,807 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:16,807 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:16,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:16,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:16,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-09-08 19:29:16,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-08 19:29:19,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:29:19,740 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-09-08 19:29:19,927 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:29:19,928 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:29:19,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1428345025, now seen corresponding path program 1 times [2024-09-08 19:29:19,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:19,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924264143] [2024-09-08 19:29:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:19,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:29:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:29:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924264143] [2024-09-08 19:29:22,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924264143] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:29:22,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742887270] [2024-09-08 19:29:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:22,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:29:22,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:29:22,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:29:22,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-08 19:29:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:22,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-08 19:29:22,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:29:22,576 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 19:29:22,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 19:29:22,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-09-08 19:29:22,682 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-08 19:29:22,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 17 treesize of output 21 [2024-09-08 19:29:22,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 19:29:22,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 19:29:22,877 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-08 19:29:22,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-09-08 19:29:23,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:29:23,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2024-09-08 19:29:23,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-09-08 19:29:23,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2024-09-08 19:29:23,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:29:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:29:23,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:29:24,640 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:29:24,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:29:24,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 237 [2024-09-08 19:29:24,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-08 19:29:24,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2024-09-08 19:29:24,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:29:24,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 68 [2024-09-08 19:29:24,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-09-08 19:29:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 1 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:29:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742887270] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:29:25,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:29:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 12] total 44 [2024-09-08 19:29:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809693970] [2024-09-08 19:29:25,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:29:25,026 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-09-08 19:29:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-09-08 19:29:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1823, Unknown=17, NotChecked=0, Total=1980 [2024-09-08 19:29:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:25,028 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:25,028 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2888888888888888) internal successors, (103), 44 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:25,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:25,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:25,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-09-08 19:29:25,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:29:25,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-08 19:29:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:29:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-08 19:29:28,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-08 19:29:29,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-08 19:29:29,077 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:29:29,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2096898662, now seen corresponding path program 2 times [2024-09-08 19:29:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:29,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211466764] [2024-09-08 19:29:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 19:29:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:29:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211466764] [2024-09-08 19:29:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211466764] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:29:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563987115] [2024-09-08 19:29:30,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 19:29:30,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:29:30,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:29:30,051 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:29:30,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-08 19:29:30,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 19:29:30,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 19:29:30,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-08 19:29:30,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:29:30,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:29:30,471 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2024-09-08 19:29:30,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 92 [2024-09-08 19:29:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 19:29:30,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:29:31,273 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-08 19:29:31,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2024-09-08 19:29:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 19:29:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563987115] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:29:31,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:29:31,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 28 [2024-09-08 19:29:31,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368003512] [2024-09-08 19:29:31,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:29:31,275 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-08 19:29:31,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:31,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-08 19:29:31,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=669, Unknown=2, NotChecked=0, Total=812 [2024-09-08 19:29:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:31,277 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:31,277 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5) internal successors, (98), 29 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:31,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:31,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:31,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-09-08 19:29:31,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:29:31,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-09-08 19:29:31,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:34,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:29:35,612 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse4 (mod (select .cse6 |c_~#value~0.offset|) 4294967296))) (let ((.cse2 (= .cse3 .cse4)) (.cse0 (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1)) (.cse1 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (= |c_thr1Thread2of3ForFork0_~vn~0#1| .cse0) .cse1) (or .cse2 (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse3 (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)))) (< .cse3 .cse4) (or (not .cse2) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse3 (mod (select (select (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| .cse0)))) (store .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)))) (or (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (not .cse1)))))) is different from false [2024-09-08 19:29:37,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:29:41,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 19:29:43,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-08 19:29:45,982 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-09-08 19:29:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 19:29:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:29:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-08 19:29:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-08 19:29:46,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-08 19:29:46,233 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-08 19:29:46,233 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:29:46,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:29:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1485834762, now seen corresponding path program 1 times [2024-09-08 19:29:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:29:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866770290] [2024-09-08 19:29:46,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:29:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:29:47,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:29:47,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866770290] [2024-09-08 19:29:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866770290] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:29:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100723388] [2024-09-08 19:29:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:29:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:29:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:29:47,440 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:29:47,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-08 19:29:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:29:47,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-08 19:29:47,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:29:47,607 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 19:29:47,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 19:29:47,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-09-08 19:29:47,692 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-09-08 19:29:47,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-09-08 19:29:47,798 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-08 19:29:47,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-09-08 19:29:47,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-08 19:29:47,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2024-09-08 19:29:47,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-08 19:29:47,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:29:47,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-09-08 19:29:47,983 INFO L349 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2024-09-08 19:29:47,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 111 [2024-09-08 19:29:48,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:29:48,061 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-09-08 19:29:48,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 56 [2024-09-08 19:29:48,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 19:29:48,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:29:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:29:48,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:29:50,539 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (let ((.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3)))) (or .cse0 (forall ((v_DerPreprocessor_32 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_32 |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_32) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) is different from false [2024-09-08 19:29:50,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2))))) is different from false [2024-09-08 19:29:53,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:29:53,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-09-08 19:29:53,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-08 19:29:53,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:29:53,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-09-08 19:29:53,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:29:53,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2787 treesize of output 2354 [2024-09-08 19:29:53,569 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-09-08 19:29:53,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 51 [2024-09-08 19:29:53,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-09-08 19:29:53,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:29:53,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-09-08 19:29:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 5 not checked. [2024-09-08 19:29:53,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100723388] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:29:53,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:29:53,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 16] total 44 [2024-09-08 19:29:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579272812] [2024-09-08 19:29:53,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:29:53,697 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-08 19:29:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:29:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-08 19:29:53,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1530, Unknown=17, NotChecked=162, Total=1892 [2024-09-08 19:29:53,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:53,699 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:29:53,699 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.840909090909091) internal successors, (125), 44 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:29:53,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:53,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:29:53,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-09-08 19:29:53,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:29:53,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-08 19:29:53,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-09-08 19:29:53,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:29:56,109 WARN L854 $PredicateComparison]: unable to prove that (and (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2))))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))) is different from false [2024-09-08 19:29:59,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse3 (not .cse2))) (and (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3)))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) .cse3)))) is different from false [2024-09-08 19:30:02,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (select .cse1 |c_~#value~0.offset|))) (and (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse0 (mod .cse3 4294967296)) (.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse2) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2)))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (not (= (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse3) (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse3 4294967296) 4294967296))))))) is different from false [2024-09-08 19:30:04,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse23 (select .cse9 |c_~#value~0.offset|))) (let ((.cse13 (mod .cse23 4294967296))) (let ((.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse15 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse4 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse13))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse4)) (.cse16 (= .cse15 1)) (.cse14 (not .cse11)) (.cse12 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) .cse12 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse13 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse13 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse14)) (< 0 (mod .cse15 4294967296)) (< 0 (mod |c_thr1Thread2of3ForFork0_#t~mem6#1| 4294967296))) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (and .cse16 (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1)) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse18 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse18 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse19 (select .cse18 |c_~#value~0.base|))) (< (mod (select .cse19 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse18 |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse22 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse20 (store .cse22 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse21 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse20 |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) .cse14) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse16 .cse14 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse23) .cse12 (let ((.cse24 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|))) (or (and .cse24 (= 1 .cse23)) (and .cse24 (= 0 .cse23)))))))))))) is different from false [2024-09-08 19:30:05,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (select .cse5 |c_~#value~0.offset|))) (let ((.cse6 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (mod .cse8 4294967296))) (let ((.cse9 (= .cse6 .cse3))) (let ((.cse0 (not .cse9)) (.cse7 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse0 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse1 (store .cse2 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (let ((.cse4 (select .cse1 |c_~#value~0.base|))) (< (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse1 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (< .cse6 .cse3) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse3 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse7) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse3 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse7))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (not (= (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse8) (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse8 4294967296) 4294967296)))) (or .cse9 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse11 (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (< (mod (select .cse12 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse0 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse16 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse13 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse16))) (let ((.cse14 (store .cse13 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse15 (select .cse14 |c_~#value~0.base|))) (< (mod (select .cse15 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse16) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse7))))))) is different from false [2024-09-08 19:30:05,522 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse18 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse19 (mod (select .cse9 |c_~#value~0.offset|) 4294967296))) (let ((.cse4 (= .cse18 .cse19))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse4)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (and (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 1) (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1)) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse13 (store .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (< (mod (select .cse14 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse15 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse15 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse16 (select .cse15 |c_~#value~0.base|))) (< (mod (select .cse16 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse15 |c_~#value~0.base| (store .cse16 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) (not .cse11)) (< .cse18 .cse19) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|)))))) is different from false [2024-09-08 19:30:06,026 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse26 (select .cse9 |c_~#value~0.offset|))) (let ((.cse24 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse25 (mod .cse26 4294967296)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse16 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse13 (not .cse11)) (.cse12 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse27 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse28 (= 0 .cse26)) (.cse4 (= .cse24 .cse25))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse4)) (.cse14 (and .cse12 .cse27 .cse28)) (.cse15 (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse25 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse25 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse13))) (.cse23 (= .cse16 1))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) .cse12 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (or (= |c_thr1Thread3of3ForFork0_#t~mem6#1| 1) .cse13 .cse14) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse15 (< 0 (mod .cse16 4294967296))) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse18 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse18 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse19 (select .cse18 |c_~#value~0.base|))) (< (mod (select .cse19 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse18 |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse22 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse20 (store .cse22 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse21 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse20 |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) .cse13) (or .cse23 .cse13 .cse14) (< .cse24 .cse25) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse15 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or .cse23 .cse13 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse26) .cse12 (or (and .cse27 (= 1 .cse26)) (and .cse27 .cse28)))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1))))))) is different from false [2024-09-08 19:30:06,572 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse26 (select .cse9 |c_~#value~0.offset|))) (let ((.cse25 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse13 (mod .cse26 4294967296))) (let ((.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse15 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse4 (= .cse25 .cse13))) (let ((.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse10 (not .cse4)) (.cse22 (= .cse15 1)) (.cse14 (not .cse11)) (.cse12 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse23 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse24 (= 0 .cse26))) (and (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_36))) (let ((.cse3 (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (let ((.cse2 (select .cse3 |c_~#value~0.base|))) (< (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse5 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (let ((.cse6 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse7 (select .cse6 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse10)) .cse11) (= (select |c_#valid| 3) 1) .cse12 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse13 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse13 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse14)) (< 0 (mod .cse15 4294967296))) (or (and (or .cse4 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse17 (store .cse16 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse18 (select .cse17 |c_~#value~0.base|))) (< (mod (select .cse18 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse17 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse19 (store .cse21 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse19 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse20 (select .cse19 |c_~#value~0.base|))) (< (mod (select .cse20 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse19 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (= (mod (select (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse1) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse10)) .cse14) (or .cse22 .cse14 (and .cse12 .cse23 .cse24)) (< .cse25 .cse13) (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| 3)) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse22 .cse14 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse26) .cse12 (or (and .cse23 (= 1 .cse26)) (and .cse23 .cse24)))) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 0) 1))))))) is different from false [2024-09-08 19:30:10,829 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse12 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (mod (select .cse5 |c_~#value~0.offset|) 4294967296))) (let ((.cse13 (= .cse12 .cse3)) (.cse11 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse8 (not .cse11)) (.cse0 (not .cse13))) (and (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse0 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse1 (store .cse2 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (let ((.cse4 (select .cse1 |c_~#value~0.base|))) (< (mod (select .cse4 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse1 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse6 (select .cse7 |c_~#value~0.base|))) (< (mod (select .cse6 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse8) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse9 (select .cse10 |c_~#value~0.base|))) (< (mod (select .cse9 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse10 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse10 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse11)) (= .cse3 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (< .cse12 .cse3) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse3 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse3 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse8)) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) .cse8) (or .cse13 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse15 (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse15 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse16 (select .cse15 |c_~#value~0.base|))) (< (mod (select .cse16 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse15 |c_~#value~0.base| (store .cse16 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse0 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse20 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse17 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse20))) (let ((.cse18 (store .cse17 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse3) (< 0 (mod (select (select .cse18 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse19 (select .cse18 |c_~#value~0.base|))) (< (mod (select .cse19 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse20) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse11)))))) is different from false [2024-09-08 19:30:11,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#value~0.base|)) (.cse14 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse11 (not .cse14)) (.cse6 (mod (select .cse8 |c_~#value~0.offset|) 4294967296))) (let ((.cse15 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse6)) (.cse0 (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse14)) (.cse1 (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse6 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse11))) (let ((.cse2 (and .cse0 .cse1)) (.cse3 (not .cse15))) (and .cse0 .cse1 (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse2 (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))) (or .cse3 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse4 (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (let ((.cse7 (select .cse4 |c_~#value~0.base|))) (< (mod (select .cse7 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse4 |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse9 (select .cse10 |c_~#value~0.base|))) (< (mod (select .cse9 |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse10 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse11) (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (let ((.cse12 (select .cse13 |c_~#value~0.base|))) (< (mod (select .cse12 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store .cse13 |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse13 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse14)) (= .cse6 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse2 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) .cse11) (or .cse15 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse17 (store .cse16 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse18 (select .cse17 |c_~#value~0.base|))) (< (mod (select .cse18 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse17 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse3 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse22 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse20 (store .cse19 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse6) (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse21 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse14)))))) is different from false [2024-09-08 19:30:12,276 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|)) (.cse4 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse1 (select .cse3 |c_~#value~0.offset|))) (and (or .cse0 (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|) (or (= 0 .cse1) (= 1 .cse1)))) (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse2 (mod .cse1 4294967296))) (and (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse2 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse4) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse2 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse0))) (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) is different from false [2024-09-08 19:30:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:30:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:30:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-09-08 19:30:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:30:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-08 19:30:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-08 19:30:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-09-08 19:30:12,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-08 19:30:12,729 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-08 19:30:12,730 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:30:12,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:30:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1941037054, now seen corresponding path program 1 times [2024-09-08 19:30:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:30:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408407183] [2024-09-08 19:30:12,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:30:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:30:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:30:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:30:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:30:14,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408407183] [2024-09-08 19:30:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408407183] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:30:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209879373] [2024-09-08 19:30:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:30:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:30:14,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:30:14,477 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:30:14,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-08 19:30:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:30:14,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-08 19:30:14,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:30:14,650 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 19:30:14,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 19:30:14,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-09-08 19:30:14,765 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-08 19:30:14,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-09-08 19:30:14,893 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-08 19:30:14,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-09-08 19:30:14,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 19:30:14,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-09-08 19:30:14,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:30:15,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 121 [2024-09-08 19:30:15,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2024-09-08 19:30:15,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:30:15,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:30:15,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 67 [2024-09-08 19:30:15,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2024-09-08 19:30:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:30:15,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:30:17,214 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse0 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse6 |c_~#value~0.offset|) 4294967296)))) (let ((.cse9 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (.cse2 (not .cse0)) (.cse7 (not .cse3))) (and (or (and (or .cse0 (forall ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_ArrVal_626 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (mod (select v_DerPreprocessor_48 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_50))) (store (store .cse1 |c_~#value~0.base| v_DerPreprocessor_47) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_626)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or .cse2 (and (or .cse3 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_49 (Array Int Int)) (v_ArrVal_626 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (mod (select v_DerPreprocessor_48 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse5 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse5))) (store (store .cse4 |c_~#value~0.base| v_DerPreprocessor_47) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse4 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_49) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse5) |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_626)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or .cse7 (forall ((v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_626 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_47 (Array Int Int))) (or (< 0 (mod (select v_DerPreprocessor_48 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select (let ((.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store (store .cse8 |c_~#value~0.base| v_DerPreprocessor_47) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse8 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_626)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))) .cse9) (or (not .cse9) (and (or (forall ((v_prenex_56 Int) (v_prenex_57 Int) (v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select v_DerPreprocessor_48 v_prenex_57) 4294967296)) (< 0 (mod (select (select (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store v_DerPreprocessor_48 |c_~#value~0.offset| v_prenex_56)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_57 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) .cse2 .cse7) (or .cse0 (forall ((v_DerPreprocessor_51 (Array Int Int)) (v_prenex_56 Int) (v_prenex_57 Int) (v_DerPreprocessor_48 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select v_DerPreprocessor_48 v_prenex_57) 4294967296)) (< 0 (mod (select (select (let ((.cse11 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_51))) (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base| (store v_DerPreprocessor_48 |c_~#value~0.offset| v_prenex_56)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) v_prenex_57 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))))))))) is different from false [2024-09-08 19:30:17,549 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-09-08 19:30:17,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2024-09-08 19:30:17,580 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-09-08 19:30:17,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2024-09-08 19:30:18,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:30:18,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:30:18,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-08 19:30:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 9 refuted. 6 times theorem prover too weak. 2 trivial. 3 not checked. [2024-09-08 19:30:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209879373] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:30:29,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:30:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 15] total 49 [2024-09-08 19:30:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931115875] [2024-09-08 19:30:29,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:30:29,728 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-09-08 19:30:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:30:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-09-08 19:30:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2114, Unknown=27, NotChecked=94, Total=2450 [2024-09-08 19:30:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:30:29,730 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:30:29,730 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.32) internal successors, (116), 49 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:30:29,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:30:29,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:30:29,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-09-08 19:30:29,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:30:29,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-08 19:30:29,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-09-08 19:30:29,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-09-08 19:30:29,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-09-08 19:30:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-08 19:30:53,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-08 19:30:53,640 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-08 19:30:53,640 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:30:53,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:30:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash 86269143, now seen corresponding path program 2 times [2024-09-08 19:30:53,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:30:53,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287112304] [2024-09-08 19:30:53,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:30:53,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:30:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:30:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:30:55,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:30:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287112304] [2024-09-08 19:30:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287112304] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:30:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307435023] [2024-09-08 19:30:55,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 19:30:55,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:30:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:30:55,755 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:30:55,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-08 19:30:55,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-08 19:30:55,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 19:30:55,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-09-08 19:30:55,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:30:56,010 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 19:30:56,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 19:30:56,322 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-09-08 19:30:56,328 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-09-08 19:30:56,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-09-08 19:30:56,692 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-08 19:30:56,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-09-08 19:30:57,194 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-08 19:30:57,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-09-08 19:30:57,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-09-08 19:30:57,826 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 0 case distinctions, treesize of input 26 treesize of output 28 [2024-09-08 19:30:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:30:58,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:31:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:31:07,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307435023] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:31:07,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:31:07,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 14] total 49 [2024-09-08 19:31:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511938148] [2024-09-08 19:31:07,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:31:07,499 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-08 19:31:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:31:07,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-08 19:31:07,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2090, Unknown=3, NotChecked=0, Total=2352 [2024-09-08 19:31:07,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:31:07,501 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:31:07,501 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 49 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:31:07,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-09-08 19:31:07,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:31:10,114 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse23 (select .cse6 |c_~#value~0.offset|))) (let ((.cse28 (div .cse23 4294967296))) (let ((.cse14 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)) (.cse25 (* .cse28 4294967296))) (let ((.cse24 (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1)) (.cse26 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse27 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse0 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse22 (+ .cse25 1)) (.cse33 (= (mod .cse23 4294967296) .cse14))) (let ((.cse7 (not .cse33)) (.cse19 (<= .cse22 .cse23)) (.cse13 (or (forall ((v_DerPreprocessor_53 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse32 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_53))) (let ((.cse30 (select .cse32 |c_~#value~0.base|))) (let ((.cse29 (let ((.cse31 (store .cse32 |c_~#value~0.base| (store .cse30 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse31 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse31 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (< .cse0 (mod (select (select .cse29 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse29 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (mod (select .cse30 |c_~#value~0.offset|) 4294967296) .cse0))))))) .cse33)) (.cse18 (= |c_thr1Thread2of3ForFork0_~v~0#1| 1)) (.cse21 (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1)) (.cse20 (not .cse27)) (.cse15 (and (<= .cse24 .cse23) (<= .cse28 .cse26))) (.cse17 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse16 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0))) (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)))) (let ((.cse4 (store (select .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (select (store .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base|))) (let ((.cse1 (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse4) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) .cse0)))))))) .cse7) (or (and (or .cse7 (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))))) (let ((.cse11 (store (select .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store .cse12 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse11) |c_~#value~0.base|))) (let ((.cse9 (let ((.cse10 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse11) |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))))) (or (not (= .cse0 (mod (select .cse8 |c_~#value~0.offset|) 4294967296))) (< .cse0 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse9 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))))) .cse13) (= 4294967295 .cse14)) (or .cse15 (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) .cse16)) (or (and .cse17 .cse18 .cse19) .cse20) (or (and .cse18 .cse21 .cse19) .cse20) (or (and .cse17 (or (and (not (= .cse22 .cse23)) .cse18) .cse16)) .cse20) (= |c_thr1Thread2of3ForFork0_~vn~0#1| .cse24) .cse13 (or .cse20 (and .cse17 .cse18 (<= (+ |c_thr1Thread3of3ForFork0_~v~0#1| .cse25) (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) 4294967294 (* (div (* (- 1) |c_thr1Thread3of3ForFork0_~vn~0#1|) 4294967296) 4294967296) |c_thr1Thread3of3ForFork0_~vn~0#1| .cse23)))) (or (and .cse21 (= 1 .cse23)) .cse20) (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 .cse26))) (or .cse15 (and .cse17 .cse27 .cse16) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 0))))))))) is different from false [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-09-08 19:31:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-08 19:31:27,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-08 19:31:27,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-09-08 19:31:27,797 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:31:27,798 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:31:27,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:31:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash 972625747, now seen corresponding path program 1 times [2024-09-08 19:31:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:31:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912751008] [2024-09-08 19:31:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:31:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:31:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:31:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:31:29,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:31:29,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912751008] [2024-09-08 19:31:29,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912751008] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:31:29,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335095790] [2024-09-08 19:31:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:31:29,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:31:29,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:31:29,153 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:31:29,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-08 19:31:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:31:29,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-08 19:31:29,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:31:29,399 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-09-08 19:31:29,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-09-08 19:31:29,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-09-08 19:31:29,820 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-09-08 19:31:29,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-09-08 19:31:30,302 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-09-08 19:31:30,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-09-08 19:31:30,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 87 [2024-09-08 19:31:30,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:31:30,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 37 [2024-09-08 19:31:30,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2024-09-08 19:31:31,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:31:31,202 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-09-08 19:31:31,202 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 73 treesize of output 120 [2024-09-08 19:31:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:31:32,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:31:34,911 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_~#value~0.base|)) (.cse1 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (= (mod (select .cse8 |c_~#value~0.offset|) 4294967296) .cse1)) (.cse2 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (or (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (let ((.cse0 (store .cse3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= (mod (select (select .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_60 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse4) (let ((.cse6 (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))))) (store .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select .cse7 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))))) (or (not .cse4) (forall ((v_DerPreprocessor_60 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (store .cse6 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_60))) (or (< .cse1 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse5 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select v_DerPreprocessor_60 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (= .cse2 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-09-08 19:31:37,199 INFO L349 Elim1Store]: treesize reduction 15, result has 65.9 percent of original size [2024-09-08 19:31:37,200 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 3 case distinctions, treesize of input 116 treesize of output 84 [2024-09-08 19:31:37,250 INFO L349 Elim1Store]: treesize reduction 3, result has 72.7 percent of original size [2024-09-08 19:31:37,251 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 58 treesize of output 54 [2024-09-08 19:31:37,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:31:37,290 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 23 treesize of output 27 [2024-09-08 19:31:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:31:38,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335095790] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:31:38,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-08 19:31:38,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 45 [2024-09-08 19:31:38,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685185322] [2024-09-08 19:31:38,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-08 19:31:38,481 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-09-08 19:31:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 19:31:38,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-09-08 19:31:38,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1764, Unknown=26, NotChecked=88, Total=2162 [2024-09-08 19:31:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:31:38,483 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:31:38,483 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 46 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:31:38,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 89 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-09-08 19:31:38,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-08 19:31:38,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:31:52,350 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse4 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse6 |c_~#value~0.offset|) 4294967296))) (.cse1 (not (= (select |c_#valid| |c_~#value~0.base|) 0)))) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)))) (or .cse1 .cse0) (or (and (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_prenex_29 Int) (v_prenex_28 Int) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (store (store .cse2 |c_~#value~0.base| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse2 |c_~#value~0.base| (store (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_28)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) v_prenex_29 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)))) (or .cse1 (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_ArrVal_380 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (let ((.cse3 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_21))) (store .cse3 |c_~#value~0.base| (store (store (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_380) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse4) (or (not .cse4) (and (or .cse1 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_380 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (let ((.cse5 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (store .cse5 |c_~#value~0.base| (store (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_380) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_ArrVal_380 Int) (v_DerPreprocessor_17 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select (select (let ((.cse8 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse8))) (store (store .cse7 |c_~#value~0.base| v_DerPreprocessor_17) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse7 |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| v_ArrVal_380)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0))))))))) is different from false [2024-09-08 19:31:56,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:31:58,679 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-09-08 19:32:00,685 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-09-08 19:32:02,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:04,765 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-09-08 19:32:06,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:08,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:10,785 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-09-08 19:32:13,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:32:16,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:32:28,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:30,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:32,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:34,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:36,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:38,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:38,350 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (mod (select .cse15 |c_~#value~0.offset|) 4294967296)) (.cse0 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (select |c_#memory_int| 3)) (.cse2 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse8 (= .cse1 .cse0)) (.cse5 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse9 (= |c_~#value~0.base| 3)) (.cse11 (not (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)))) (and (= (select |c_#valid| 3) 1) (or (< .cse0 .cse1) (= (mod .cse2 4294967296) 0)) (<= 1 (mod (select .cse3 0) 4294967296)) (or (forall ((v_DerPreprocessor_60 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= (mod (select (select .cse4 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_60 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (= .cse5 .cse1)) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or (forall ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_61))) (let ((.cse6 (store .cse7 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_60))) (or (= (mod (select (select .cse6 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse5 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_60 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse8) (or (and .cse9 (let ((.cse10 (select .cse3 |c_~#value~0.offset|))) (<= (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse10 4294967296) 4294967296) 1) (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse10))) .cse11) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 1) (= .cse2 0)) (let ((.cse12 (let ((.cse14 (store |c_#memory_int| |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)))) (store .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select .cse14 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))))) (or (not .cse8) (= .cse5 (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (forall ((v_DerPreprocessor_60 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse13 (store .cse12 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_60))) (or (< .cse0 (mod (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_60 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse13 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))))) .cse9 (= 0 |c_~#value~0.offset|) .cse11)))) is different from false [2024-09-08 19:32:50,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:52,235 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-09-08 19:32:54,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:56,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:32:58,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:33:00,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:33:01,807 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse14 (select .cse13 |c_~#value~0.offset|)) (.cse23 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse1 (not .cse23)) (.cse11 (mod .cse14 4294967296))) (let ((.cse15 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse11)) (.cse0 (or (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse11 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse23)) (.cse5 (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse11 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse1))) (let ((.cse6 (and .cse0 .cse5)) (.cse7 (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|)) (.cse2 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse3 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse4 (= 0 .cse14)) (.cse8 (not .cse15))) (and .cse0 (or .cse1 (and .cse2 .cse3 .cse4)) .cse5 (= (select |c_#valid| 3) 1) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 0) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse6 (< 0 (mod .cse7 4294967296))) (or .cse8 (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)))) (let ((.cse9 (store .cse10 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (< 0 (mod (select (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11) (let ((.cse12 (select .cse9 |c_~#value~0.base|))) (< (mod (select .cse12 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse9 |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) (or .cse6 (< 0 (mod |c_thr1Thread3of3ForFork0_#t~mem6#1| 4294967296))) (or (= .cse7 1) .cse1 (and (= |c_thr1Thread2of3ForFork0_#t~mem6#1| .cse14) .cse2 (or (and .cse3 (= 1 .cse14)) (and .cse3 .cse4)))) (or .cse15 (forall ((v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_34 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse17 (store .cse16 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11) (< 0 (mod (select (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse18 (select .cse17 |c_~#value~0.base|))) (< (mod (select .cse18 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse17 |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse8 (forall ((v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse22 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22))) (let ((.cse20 (store .cse19 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33))) (or (= (mod (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse11) (< 0 (mod (select (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (< (mod (select .cse21 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| v_DerPreprocessor_31) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse23))))))) is different from false [2024-09-08 19:33:06,724 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse5 (select .cse1 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse5 4294967296))) (let ((.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse17 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) .cse0))) (let ((.cse6 (not .cse17)) (.cse3 (not .cse2)) (.cse4 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|))) (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 .cse3 (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) .cse4 (= 0 .cse5))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3) (= (select |c_#valid| 3) 1) (or .cse6 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_31 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_prenex_42 Int) (v_DerPreprocessor_33 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_35 (Array Int Int))) (let ((.cse9 (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 ((.cse7 (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_35) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse9))) (let ((.cse10 (store .cse7 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (= (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (let ((.cse8 (select .cse10 |c_~#value~0.base|))) (< (mod (select .cse8 |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| .cse9) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| v_prenex_42)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) .cse2) (or .cse6 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (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 ((.cse11 (store .cse12 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (< 0 (mod (select (select .cse11 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (let ((.cse13 (select .cse11 |c_~#value~0.base|))) (< (mod (select .cse13 |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 .cse11 |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296))))))) (or .cse3 (and (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) .cse4)) (or (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| Int) (v_DerPreprocessor_33 (Array Int Int)) (v_subst_33 Int) (v_DerPreprocessor_34 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse14 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_34))) (let ((.cse16 (store .cse14 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33))) (or (= (mod (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) .cse0) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) 0)) (let ((.cse15 (select .cse16 |c_~#value~0.base|))) (< (mod (select .cse15 |c_~#value~0.offset|) 4294967296) (mod (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_33) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store .cse16 |c_~#value~0.base| (store .cse15 |c_~#value~0.offset| v_subst_33)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (< 0 (mod (select (select .cse16 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_33 |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)))))) .cse17) (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|))))))) is different from false [2024-09-08 19:33:08,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (.cse4 (select .cse1 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse4 4294967296)) (.cse3 (not .cse2))) (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 .cse3 (and (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|) (= 0 .cse4))) (or (forall ((|thr1Thread2of3ForFork0_~vn~0#1| Int)) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse3))))) is different from false [2024-09-08 19:33:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-08 19:33:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-09-08 19:33:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-08 19:33:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-08 19:33:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-08 19:33:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-09-08 19:33:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-08 19:33:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-08 19:33:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-08 19:33:25,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-08 19:33:26,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:33:26,068 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:26,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1652692596, now seen corresponding path program 3 times [2024-09-08 19:33:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 19:33:26,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176242365] [2024-09-08 19:33:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:26,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 19:33:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:33:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 19:33:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176242365] [2024-09-08 19:33:30,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176242365] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-08 19:33:30,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344018656] [2024-09-08 19:33:30,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-08 19:33:30,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:33:30,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:33:30,585 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-08 19:33:30,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-08 19:33:30,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-08 19:33:30,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 19:33:30,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-08 19:33:30,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:31,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-09-08 19:33:31,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-09-08 19:33:31,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-09-08 19:33:31,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2024-09-08 19:33:31,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-08 19:33:32,363 INFO L349 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2024-09-08 19:33:32,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 96 [2024-09-08 19:33:32,567 INFO L349 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2024-09-08 19:33:32,567 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 2 case distinctions, treesize of input 99 treesize of output 95 [2024-09-08 19:33:32,577 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 47 treesize of output 45 [2024-09-08 19:33:32,632 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 0 case distinctions, treesize of input 22 treesize of output 20 [2024-09-08 19:33:32,975 INFO L349 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2024-09-08 19:33:32,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 92 [2024-09-08 19:33:33,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:33:33,067 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-08 19:33:33,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2024-09-08 19:33:33,309 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-09-08 19:33:33,309 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 1 case distinctions, treesize of input 35 treesize of output 42 [2024-09-08 19:33:33,487 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-08 19:33:33,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:33,687 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-08 19:33:33,688 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-08 19:33:33,691 INFO L158 Benchmark]: Toolchain (without parser) took 288336.81ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 136.9MB in the beginning and 336.2MB in the end (delta: -199.3MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2024-09-08 19:33:33,692 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 19:33:33,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.77ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 115.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-09-08 19:33:33,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.42ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 113.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 19:33:33,692 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 112.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 19:33:33,692 INFO L158 Benchmark]: RCFGBuilder took 623.18ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 120.4MB in the end (delta: -7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-08 19:33:33,692 INFO L158 Benchmark]: TraceAbstraction took 287127.67ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 119.4MB in the beginning and 336.2MB in the end (delta: -216.8MB). Peak memory consumption was 172.8MB. Max. memory is 16.1GB. [2024-09-08 19:33:33,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.77ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 115.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.42ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 113.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 167.8MB. Free memory was 113.8MB in the beginning and 112.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.18ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 120.4MB in the end (delta: -7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 287127.67ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 119.4MB in the beginning and 336.2MB in the end (delta: -216.8MB). Peak memory consumption was 172.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 234, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 234, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 159, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 52, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 159, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 504, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 471, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, Independence queries for same thread: 33, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 504, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 52, dependent conditional: 33, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 471, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, Independence queries for same thread: 33 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-08 19:33:33,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:33,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:34,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:34,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:34,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 19:33:36,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 19:33:36,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-09-08 19:33:36,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 19:33:36,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 19:33:36,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 19:33:36,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 19:33:36,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 19:33:36,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 19:33:36,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 19:33:36,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 19:33:36,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 19:33:36,822 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 19:33:36,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 19:33:36,825 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 19:33:36,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 19:33:36,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 19:33:36,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 19:33:36,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 19:33:36,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 19:33:36,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 19:33:36,830 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-08 19:33:36,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 19:33:36,831 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-08 19:33:36,831 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 19:33:36,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 19:33:36,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 19:33:36,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 19:33:36,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 19:33:36,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 19:33:36,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 19:33:36,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 19:33:36,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 19:33:36,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 19:33:36,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 19:33:36,836 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-08 19:33:36,836 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 19:33:36,836 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-08 19:33:36,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 19:33:36,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 19:33:36,837 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 19:33:36,838 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 19:33:36,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-08 19:33:36,838 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2024-09-08 19:33:37,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 19:33:37,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 19:33:37,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 19:33:37,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 19:33:37,228 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 19:33:37,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-09-08 19:33:38,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 19:33:39,017 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 19:33:39,022 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-09-08 19:33:39,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/27d822c0f/b0be1ba47c78460db83eea9e613e2c30/FLAGddff90a43 [2024-09-08 19:33:39,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/27d822c0f/b0be1ba47c78460db83eea9e613e2c30 [2024-09-08 19:33:39,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 19:33:39,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-08 19:33:39,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 19:33:39,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 19:33:39,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 19:33:39,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241b1a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39, skipping insertion in model container [2024-09-08 19:33:39,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 19:33:39,470 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-09-08 19:33:39,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 19:33:39,496 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 19:33:39,555 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-09-08 19:33:39,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 19:33:39,606 INFO L204 MainTranslator]: Completed translation [2024-09-08 19:33:39,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39 WrapperNode [2024-09-08 19:33:39,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 19:33:39,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 19:33:39,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 19:33:39,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 19:33:39,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,648 INFO L138 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-09-08 19:33:39,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 19:33:39,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 19:33:39,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 19:33:39,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 19:33:39,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,671 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 19:33:39,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 19:33:39,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 19:33:39,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 19:33:39,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (1/1) ... [2024-09-08 19:33:39,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 19:33:39,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:33:39,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-09-08 19:33:39,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-09-08 19:33:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-09-08 19:33:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-09-08 19:33:39,774 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-09-08 19:33:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 19:33:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 19:33:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-08 19:33:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-08 19:33:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-09-08 19:33:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-09-08 19:33:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-09-08 19:33:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 19:33:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 19:33:39,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 19:33:39,778 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 19:33:39,911 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 19:33:39,913 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 19:33:40,116 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 19:33:40,117 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 19:33:40,285 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 19:33:40,285 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-08 19:33:40,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:33:40 BoogieIcfgContainer [2024-09-08 19:33:40,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 19:33:40,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 19:33:40,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 19:33:40,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 19:33:40,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:33:39" (1/3) ... [2024-09-08 19:33:40,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bae8b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:33:40, skipping insertion in model container [2024-09-08 19:33:40,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:33:39" (2/3) ... [2024-09-08 19:33:40,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bae8b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:33:40, skipping insertion in model container [2024-09-08 19:33:40,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:33:40" (3/3) ... [2024-09-08 19:33:40,296 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-09-08 19:33:40,313 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 19:33:40,313 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-08 19:33:40,313 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 19:33:40,357 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:33:40,402 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:40,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:33:40,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:33:40,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:33:40,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-09-08 19:33:40,437 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:33:40,450 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-09-08 19:33:40,455 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63e350f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:40,457 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:33:40,554 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:40,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1901459519, now seen corresponding path program 1 times [2024-09-08 19:33:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272862721] [2024-09-08 19:33:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:40,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:40,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:40,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-08 19:33:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:40,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-08 19:33:40,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:33:40,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:40,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272862721] [2024-09-08 19:33:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272862721] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:40,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:33:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172104087] [2024-09-08 19:33:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:40,716 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:33:40,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:40,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:33:40,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:33:40,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:40,754 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:40,755 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:40,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:40,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-09-08 19:33:41,033 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:41,034 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:41,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1726443972, now seen corresponding path program 1 times [2024-09-08 19:33:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354367274] [2024-09-08 19:33:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:41,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:41,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:41,042 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:41,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-08 19:33:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:41,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-08 19:33:41,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:41,279 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 19:33:41,280 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 13 treesize of output 13 [2024-09-08 19:33:41,475 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-09-08 19:33:41,482 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-09-08 19:33:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:33:41,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:41,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:41,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354367274] [2024-09-08 19:33:41,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354367274] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:41,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:41,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 19:33:41,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928693002] [2024-09-08 19:33:41,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:41,529 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 19:33:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 19:33:41,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-08 19:33:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:41,531 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:41,531 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:41,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:41,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:41,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-09-08 19:33:41,935 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:41,936 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:41,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:41,937 INFO L85 PathProgramCache]: Analyzing trace with hash -102633002, now seen corresponding path program 1 times [2024-09-08 19:33:41,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:41,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139074850] [2024-09-08 19:33:41,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:41,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:41,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:41,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:41,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-08 19:33:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:42,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 19:33:42,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:42,097 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 19:33:42,098 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-09-08 19:33:42,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:33:42,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:33:42,267 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 16 treesize of output 5 [2024-09-08 19:33:42,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-08 19:33:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:33:42,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:42,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:42,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139074850] [2024-09-08 19:33:42,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139074850] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:42,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 19:33:42,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714821532] [2024-09-08 19:33:42,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:42,302 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 19:33:42,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:42,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 19:33:42,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 19:33:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:42,305 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:42,305 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:42,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:42,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:42,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:33:42,453 INFO L785 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-08 19:33:42,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-09-08 19:33:42,654 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:42,659 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-08 19:33:42,662 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-09-08 19:33:42,669 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:42,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:33:42,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:33:42,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:33:42,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-09-08 19:33:42,676 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:33:42,677 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 19:33:42,679 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63e350f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:42,679 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:33:42,729 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:33:42,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1941491556, now seen corresponding path program 1 times [2024-09-08 19:33:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790656889] [2024-09-08 19:33:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:42,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:42,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:42,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-08 19:33:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:42,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-08 19:33:42,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:33:42,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:42,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:42,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790656889] [2024-09-08 19:33:42,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790656889] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:42,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:42,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:33:42,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170708016] [2024-09-08 19:33:42,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:42,793 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:33:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:42,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:33:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:33:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:42,795 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:42,795 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:42,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:42,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-08 19:33:43,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:43,076 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:33:43,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1255275433, now seen corresponding path program 1 times [2024-09-08 19:33:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628981462] [2024-09-08 19:33:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:43,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:43,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:43,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-09-08 19:33:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:43,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-08 19:33:43,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:43,249 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 19:33:43,250 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 13 treesize of output 13 [2024-09-08 19:33:43,377 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-09-08 19:33:43,384 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-09-08 19:33:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:33:43,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:43,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:43,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628981462] [2024-09-08 19:33:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628981462] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 19:33:43,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673268986] [2024-09-08 19:33:43,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:43,438 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 19:33:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:43,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 19:33:43,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-08 19:33:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:43,439 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:43,440 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:43,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:43,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:43,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-09-08 19:33:43,807 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:43,808 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:33:43,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash 567669754, now seen corresponding path program 1 times [2024-09-08 19:33:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:43,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594415678] [2024-09-08 19:33:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:43,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:43,811 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:43,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-09-08 19:33:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:33:43,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 19:33:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:33:43,938 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 19:33:43,938 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 19:33:43,939 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 19:33:43,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:44,139 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:44,141 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-08 19:33:44,141 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-09-08 19:33:44,142 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 19:33:44,142 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-09-08 19:33:44,168 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:33:44,170 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:44,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:33:44,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:33:44,173 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:33:44,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-09-08 19:33:44,182 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:33:44,183 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 19:33:44,183 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63e350f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:44,184 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:33:44,279 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:33:44,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash -684009113, now seen corresponding path program 1 times [2024-09-08 19:33:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139607106] [2024-09-08 19:33:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:44,285 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:44,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-09-08 19:33:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:44,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-08 19:33:44,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:33:44,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:44,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139607106] [2024-09-08 19:33:44,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139607106] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:44,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:44,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:33:44,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732911112] [2024-09-08 19:33:44,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:44,353 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:33:44,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:44,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:33:44,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:33:44,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:44,354 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:44,354 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:44,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:44,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:44,682 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:44,682 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:33:44,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -233072803, now seen corresponding path program 1 times [2024-09-08 19:33:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822525792] [2024-09-08 19:33:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:44,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:44,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:44,685 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:44,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-09-08 19:33:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:44,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-08 19:33:44,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:44,842 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 19:33:44,843 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 13 treesize of output 13 [2024-09-08 19:33:44,942 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-09-08 19:33:44,948 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-09-08 19:33:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:33:44,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:44,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822525792] [2024-09-08 19:33:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822525792] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:44,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:44,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 19:33:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133269055] [2024-09-08 19:33:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:45,000 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 19:33:45,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:45,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 19:33:45,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-08 19:33:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:45,002 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:45,002 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:45,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:45,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:45,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-09-08 19:33:45,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:45,423 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:33:45,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 941732032, now seen corresponding path program 1 times [2024-09-08 19:33:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429369460] [2024-09-08 19:33:45,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:45,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:45,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:45,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:45,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-09-08 19:33:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:45,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-08 19:33:45,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:45,575 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-09-08 19:33:45,576 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 21 treesize of output 20 [2024-09-08 19:33:45,663 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 16 treesize of output 13 [2024-09-08 19:33:45,694 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 19:33:45,694 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 13 treesize of output 13 [2024-09-08 19:33:45,785 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 26 treesize of output 21 [2024-09-08 19:33:45,790 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 18 treesize of output 13 [2024-09-08 19:33:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:33:45,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:33:46,013 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse1 |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_4) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of2ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-09-08 19:33:46,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:33:46,034 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 38 treesize of output 26 [2024-09-08 19:33:46,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-09-08 19:33:46,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-09-08 19:33:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:33:46,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:46,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429369460] [2024-09-08 19:33:46,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429369460] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:33:46,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 19:33:46,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-09-08 19:33:46,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770394000] [2024-09-08 19:33:46,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 19:33:46,229 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-08 19:33:46,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-08 19:33:46,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=114, Unknown=7, NotChecked=22, Total=182 [2024-09-08 19:33:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:46,231 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:46,231 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:46,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:46,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:46,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 19:33:46,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:46,825 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:46,826 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-09-08 19:33:46,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:46,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1232077437, now seen corresponding path program 1 times [2024-09-08 19:33:46,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:46,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635799435] [2024-09-08 19:33:46,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:46,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:46,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:46,832 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:46,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-09-08 19:33:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:33:46,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 19:33:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 19:33:46,999 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-09-08 19:33:47,000 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 19:33:47,000 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-09-08 19:33:47,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-09-08 19:33:47,200 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:47,202 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-08 19:33:47,202 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-09-08 19:33:47,202 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-09-08 19:33:47,202 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-09-08 19:33:47,231 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 19:33:47,234 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:47,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 19:33:47,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 19:33:47,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 19:33:47,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Waiting until timeout for monitored process [2024-09-08 19:33:47,241 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 19:33:47,241 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-09-08 19:33:47,241 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63e350f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 19:33:47,243 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-08 19:33:47,422 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:47,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash -951796455, now seen corresponding path program 1 times [2024-09-08 19:33:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:47,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573058966] [2024-09-08 19:33:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:47,426 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:47,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-09-08 19:33:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:47,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-08 19:33:47,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 19:33:47,503 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:47,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:47,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573058966] [2024-09-08 19:33:47,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573058966] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:47,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:47,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 19:33:47,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536923261] [2024-09-08 19:33:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:47,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-08 19:33:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-08 19:33:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-08 19:33:47,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:47,520 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:47,520 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:47,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:47,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-09-08 19:33:47,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:47,898 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:47,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:47,898 INFO L85 PathProgramCache]: Analyzing trace with hash -480918518, now seen corresponding path program 1 times [2024-09-08 19:33:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611229698] [2024-09-08 19:33:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:47,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:47,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:47,902 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:47,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-09-08 19:33:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:48,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-08 19:33:48,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:48,369 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-09-08 19:33:48,370 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 2 case distinctions, treesize of input 35 treesize of output 18 [2024-09-08 19:33:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-08 19:33:48,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:48,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611229698] [2024-09-08 19:33:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611229698] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:48,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:48,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 19:33:48,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069708150] [2024-09-08 19:33:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:48,428 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 19:33:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:48,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 19:33:48,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-08 19:33:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:48,429 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:48,430 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:48,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:48,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:33:48,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-09-08 19:33:49,043 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:49,043 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:49,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash -890872014, now seen corresponding path program 1 times [2024-09-08 19:33:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717272959] [2024-09-08 19:33:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:49,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:49,046 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:49,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-09-08 19:33:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:49,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-08 19:33:49,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:49,204 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 19:33:49,205 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-09-08 19:33:49,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:33:49,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:33:49,241 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 8 treesize of output 1 [2024-09-08 19:33:49,251 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 31 treesize of output 12 [2024-09-08 19:33:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-08 19:33:49,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:49,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:49,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717272959] [2024-09-08 19:33:49,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717272959] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:49,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:49,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 19:33:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059850767] [2024-09-08 19:33:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:49,281 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 19:33:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 19:33:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 19:33:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:49,282 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:49,282 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:49,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:49,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:33:49,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:33:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:33:49,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:49,696 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:49,696 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:49,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1439255533, now seen corresponding path program 1 times [2024-09-08 19:33:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108108806] [2024-09-08 19:33:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:49,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:49,700 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:49,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-09-08 19:33:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:49,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-08 19:33:49,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:49,861 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 19:33:49,861 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 13 treesize of output 13 [2024-09-08 19:33:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-09-08 19:33:49,962 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-09-08 19:33:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:33:49,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:33:49,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:49,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108108806] [2024-09-08 19:33:49,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108108806] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:33:49,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:33:49,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 19:33:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494170201] [2024-09-08 19:33:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:33:49,994 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 19:33:49,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 19:33:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-08 19:33:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:49,995 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:49,995 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:49,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:49,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:33:49,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:33:49,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:33:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:33:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:50,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-09-08 19:33:50,476 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:50,477 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:33:50,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:33:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -622552755, now seen corresponding path program 1 times [2024-09-08 19:33:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:33:50,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363857238] [2024-09-08 19:33:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:33:50,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:33:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:33:50,479 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:33:50,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-09-08 19:33:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:33:50,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-08 19:33:50,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:33:50,656 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-09-08 19:33:50,657 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 21 treesize of output 20 [2024-09-08 19:33:50,767 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-09-08 19:33:50,771 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-09-08 19:33:50,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 16 treesize of output 13 [2024-09-08 19:33:50,868 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 19:33:50,868 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 13 treesize of output 13 [2024-09-08 19:33:50,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-09-08 19:33:50,964 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-09-08 19:33:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:33:50,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:33:51,046 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)) (not .cse0))))) is different from false [2024-09-08 19:33:51,063 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|))) (or (not .cse0) (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (bvadd |c_thr1Thread2of3ForFork0_~v~0#1| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_~v~0#1|)))))) is different from false [2024-09-08 19:33:51,070 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)))) is different from false [2024-09-08 19:33:56,488 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse6 |c_~#value~0.offset|) |c_thr1Thread1of3ForFork0_~v~0#1|))) (and (or .cse0 (forall ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|)))))) (or (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse5))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5))))) (not .cse0))))) is different from false [2024-09-08 19:33:56,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (select .cse6 |c_~#value~0.offset|) |c_thr1Thread1of3ForFork0_~v~0#1|))) (and (or .cse0 (forall ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|)))))) (or (not .cse0) (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (bvadd (_ bv1 32) |c_thr1Thread1of3ForFork0_~v~0#1|))) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse5 (select .cse4 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse5))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5))))))))) is different from false [2024-09-08 19:33:56,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) (select .cse2 |c_~#value~0.offset|))))) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))))) is different from false [2024-09-08 19:33:56,676 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| (_ BitVec 32)) (v_ArrVal_243 (_ BitVec 1)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| v_ArrVal_243) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (store .cse2 |c_~#value~0.offset| (bvadd (_ bv1 32) (select .cse2 |c_~#value~0.offset|))))) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| v_DerPreprocessor_7) |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_14| v_DerPreprocessor_7) |c_~#value~0.base| (store .cse0 |c_~#value~0.offset| (bvadd .cse1 (_ bv1 32)))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| v_DerPreprocessor_5) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))))) is different from false [2024-09-08 19:33:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-09-08 19:33:56,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:33:56,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363857238] [2024-09-08 19:33:56,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363857238] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:33:56,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 19:33:56,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-09-08 19:33:56,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944872398] [2024-09-08 19:33:56,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 19:33:56,727 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-08 19:33:56,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:33:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-08 19:33:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=162, Unknown=14, NotChecked=224, Total=462 [2024-09-08 19:33:56,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:56,728 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:33:56,728 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:33:56,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:56,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:33:56,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:33:56,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:33:56,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:33:59,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:01,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:03,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:07,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:09,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:11,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:13,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:15,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:34:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:34:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:34:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:34:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-08 19:34:15,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-09-08 19:34:15,635 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:34:15,636 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:34:15,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:34:15,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1527260048, now seen corresponding path program 1 times [2024-09-08 19:34:15,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:34:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655982386] [2024-09-08 19:34:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:34:15,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:34:15,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:34:15,638 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:34:15,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-09-08 19:34:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:34:15,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-08 19:34:15,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:34:15,815 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-09-08 19:34:15,815 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 21 treesize of output 20 [2024-09-08 19:34:16,023 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 16 treesize of output 13 [2024-09-08 19:34:16,108 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-08 19:34:16,108 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 16 treesize of output 17 [2024-09-08 19:34:16,309 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-09-08 19:34:16,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 83 [2024-09-08 19:34:16,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:34:16,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:34:16,378 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 0 case distinctions, treesize of input 33 treesize of output 31 [2024-09-08 19:34:16,462 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 16 treesize of output 5 [2024-09-08 19:34:16,750 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-09-08 19:34:16,751 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 16 treesize of output 17 [2024-09-08 19:34:16,964 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-09-08 19:34:16,964 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 13 treesize of output 13 [2024-09-08 19:34:17,354 INFO L349 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2024-09-08 19:34:17,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2024-09-08 19:34:17,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:34:17,384 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-09-08 19:34:17,385 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 26 treesize of output 28 [2024-09-08 19:34:17,407 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 21 treesize of output 16 [2024-09-08 19:34:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:34:17,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:34:17,922 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv1 32) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select .cse1 |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse0)))) (= (_ bv0 32) .cse2))) is different from false [2024-09-08 19:34:18,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_13))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse1 (select .cse3 |c_~#value~0.offset|))) (let ((.cse4 (bvadd (_ bv1 32) .cse1))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1) (= (_ bv0 32) .cse4) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|)))))))))) (or (not .cse0) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse6 (store (select .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (select (store .cse9 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base|))) (let ((.cse5 (select .cse7 |c_~#value~0.offset|))) (let ((.cse8 (bvadd (_ bv1 32) .cse5))) (or (not (bvugt .cse5 |c_thr1Thread2of3ForFork0_~v~0#1|)) (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| .cse8)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= (_ bv0 32) .cse8))))))))))) is different from false [2024-09-08 19:34:18,923 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse0 (store (select .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32)))) (let ((.cse1 (select (store .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base|))) (let ((.cse3 (select .cse1 |c_~#value~0.offset|))) (let ((.cse2 (bvadd (_ bv1 32) .cse3))) (or (bvugt (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse0) |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3) (not (bvugt .cse3 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= (_ bv0 32) .cse2)))))))) is different from false [2024-09-08 19:34:19,040 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (= .cse1 (_ bv0 32)) (not (= (_ bv0 1) (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-09-08 19:34:19,306 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| (_ BitVec 32)) (v_ArrVal_279 (_ BitVec 1)) (v_ArrVal_274 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_278))) (let ((.cse2 (store (select .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16|) (_ bv0 32) (_ bv1 32)))) (let ((.cse3 (select (store .cse4 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base|))) (let ((.cse0 (select .cse3 |c_~#value~0.offset|))) (let ((.cse1 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (not (= (_ bv0 1) (select (store (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_274) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (= .cse1 (_ bv0 32)) (bvugt (select (select (store (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_16| .cse2) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse1)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0)))))))) is different from false [2024-09-08 19:34:19,393 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-09-08 19:34:19,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 316 treesize of output 308 [2024-09-08 19:34:19,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:34:19,419 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 2 case distinctions, treesize of input 151 treesize of output 136 [2024-09-08 19:34:19,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:34:19,456 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 54 treesize of output 58 [2024-09-08 19:34:19,476 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 154 treesize of output 134 [2024-09-08 19:34:19,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:34:19,506 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 73 treesize of output 75 [2024-09-08 19:34:19,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-08 19:34:19,560 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 48 treesize of output 48 [2024-09-08 19:34:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-09-08 19:34:26,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:34:26,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655982386] [2024-09-08 19:34:26,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655982386] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:34:26,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 19:34:26,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-09-08 19:34:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808810133] [2024-09-08 19:34:26,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 19:34:26,177 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-08 19:34:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:34:26,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-08 19:34:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=20, NotChecked=230, Total=756 [2024-09-08 19:34:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:34:26,178 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:34:26,178 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:34:26,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:34:26,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:34:26,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:34:26,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:34:26,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-09-08 19:34:26,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:34:29,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:31,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:34,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:36,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:38,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:41,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:43,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:45,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:47,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:49,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:51,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:53,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:34:54,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:55,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:57,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:34:59,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:35:01,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:35:03,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:35:05,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:07,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:09,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:35:11,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:14,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:16,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:18,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:20,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:22,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:24,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:26,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:31,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:35:34,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:35:36,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:35:37,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse5 (bvadd (_ bv1 32) .cse1))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5))) (.cse2 (= (_ bv0 32) .cse5)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1))) (and (= |c_~#value~0.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (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_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (not (bvugt .cse1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3) (= (_ bv3 32) |c_~#value~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))))))) is different from false [2024-09-08 19:35:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:35:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:35:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:35:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:35:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 19:35:40,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-08 19:35:40,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-09-08 19:35:40,802 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:35:40,802 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:35:40,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:35:40,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1064699712, now seen corresponding path program 1 times [2024-09-08 19:35:40,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:35:40,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917431574] [2024-09-08 19:35:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:35:40,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:35:40,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:35:40,804 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:35:40,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-09-08 19:35:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:35:40,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-08 19:35:40,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:35:41,031 INFO L349 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2024-09-08 19:35:41,031 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 64 [2024-09-08 19:35:41,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:35:41,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:35:41,113 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 16 treesize of output 5 [2024-09-08 19:35:41,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-09-08 19:35:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-08 19:35:41,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-08 19:35:41,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:35:41,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917431574] [2024-09-08 19:35:41,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917431574] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 19:35:41,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 19:35:41,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 19:35:41,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099974958] [2024-09-08 19:35:41,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 19:35:41,137 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 19:35:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:35:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 19:35:41,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-08 19:35:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:35:41,138 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:35:41,138 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:35:41,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:35:41,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:35:41,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:35:41,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:35:41,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 19:35:41,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-09-08 19:35:41,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:35:41,939 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (select .cse1 |c_~#value~0.offset|))) (and (bvugt .cse0 |c_thr1Thread3of3ForFork0_~v~0#1|) (let ((.cse2 (bvadd (_ bv1 32) .cse0))) (or (not (bvugt .cse0 |c_thr1Thread2of3ForFork0_~v~0#1|)) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| .cse2)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse0))) (= (_ bv0 32) .cse2)))))) is different from false [2024-09-08 19:35:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:35:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:35:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:35:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:35:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-08 19:35:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-08 19:35:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 19:35:42,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-09-08 19:35:42,589 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:35:42,589 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:35:42,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:35:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2109860931, now seen corresponding path program 1 times [2024-09-08 19:35:42,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:35:42,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075663736] [2024-09-08 19:35:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 19:35:42,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:35:42,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:35:42,591 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:35:42,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-09-08 19:35:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 19:35:42,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-08 19:35:42,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:35:42,744 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-09-08 19:35:42,745 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 21 treesize of output 20 [2024-09-08 19:35:42,839 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 16 treesize of output 13 [2024-09-08 19:35:42,882 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-09-08 19:35:42,882 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 27 [2024-09-08 19:35:43,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-08 19:35:43,011 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 14 treesize of output 14 [2024-09-08 19:35:43,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:35:43,151 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-09-08 19:35:43,151 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 20 treesize of output 22 [2024-09-08 19:35:43,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2024-09-08 19:35:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-08 19:35:43,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-08 19:35:43,471 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or (not .cse0) (let ((.cse1 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) (not .cse1)) (or (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_16) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1)))) (or (forall ((v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse0))) is different from false [2024-09-08 19:35:45,956 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= (_ bv0 1) (select |c_#valid| |c_~#value~0.base|)))) (.cse0 (= |c_thr1Thread2of3ForFork0_~v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (or (and (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|)))) .cse1) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_353 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| (_ BitVec 32))) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17|))) (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| v_ArrVal_353) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| (_ bv1 32))) |c_~#value~0.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_17| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|))))))) (not .cse0)))) is different from false [2024-09-08 19:35:46,037 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 42 treesize of output 40 [2024-09-08 19:35:46,041 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 40 treesize of output 36 [2024-09-08 19:35:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 19:35:53,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:35:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075663736] [2024-09-08 19:35:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075663736] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-08 19:35:53,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-08 19:35:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-09-08 19:35:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362519999] [2024-09-08 19:35:53,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-08 19:35:53,629 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-08 19:35:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-08 19:35:53,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-08 19:35:53,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=263, Unknown=13, NotChecked=70, Total=420 [2024-09-08 19:35:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:35:53,630 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 19:35:53,630 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-08 19:35:53,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:35:53,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:35:53,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:35:53,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:35:53,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-09-08 19:35:53,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-09-08 19:35:53,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 19:35:53,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:36:13,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse4 |c_~#value~0.offset|))) (let ((.cse7 (bvadd (_ bv1 32) .cse1))) (let ((.cse6 (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32))) (.cse0 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse7))) (.cse2 (= (_ bv0 32) .cse7)) (.cse3 (= |c_thr1Thread3of3ForFork0_~v~0#1| .cse1)) (.cse5 (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32)))))) (and (= |c_~#value~0.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store .cse0 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)) .cse2) (or (not .cse3) (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (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_11) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|))) (or (= (_ bv3 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) .cse5) (not (= (_ bv0 32) .cse6)) (= |c_thr1Thread2of3ForFork0_~v~0#1| .cse6) (or (forall ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_279 (_ BitVec 1)) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_ArrVal_279) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|))) (bvugt (select (select (store .cse0 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| v_DerPreprocessor_11) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) .cse2) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_12) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_~v~0#1|)) .cse3) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) (= (_ bv3 32) |c_~#value~0.base|) .cse5))))) is different from false [2024-09-08 19:36:15,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:36:17,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-08 19:36:19,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-08 19:36:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 19:36:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 19:36:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 19:36:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-08 19:36:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-08 19:36:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-08 19:36:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 19:36:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-08 19:36:19,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-09-08 19:36:19,967 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:36:19,967 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-08 19:36:19,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 19:36:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2145061354, now seen corresponding path program 2 times [2024-09-08 19:36:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-08 19:36:19,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389666092] [2024-09-08 19:36:19,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-08 19:36:19,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:36:19,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-09-08 19:36:19,969 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-08 19:36:19,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-09-08 19:36:20,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-08 19:36:20,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-08 19:36:20,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-08 19:36:20,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-08 19:36:20,150 INFO L349 Elim1Store]: treesize reduction 23, result has 54.0 percent of original size [2024-09-08 19:36:20,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 78 [2024-09-08 19:36:20,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-09-08 19:36:20,218 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-08 19:36:20,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2024-09-08 19:36:20,391 INFO L349 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2024-09-08 19:36:20,392 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 14 [2024-09-08 19:36:20,453 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-09-08 19:36:20,453 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 1 case distinctions, treesize of input 25 treesize of output 32 [2024-09-08 19:36:20,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-08 19:36:20,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389666092] [2024-09-08 19:36:20,493 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-08 19:36:20,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-09-08 19:36:20,694 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-08 19:36:20,695 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-08 19:36:20,699 INFO L158 Benchmark]: Toolchain (without parser) took 161633.99ms. Allocated memory was 77.6MB in the beginning and 163.6MB in the end (delta: 86.0MB). Free memory was 47.9MB in the beginning and 96.4MB in the end (delta: -48.5MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2024-09-08 19:36:20,699 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 58.7MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 19:36:20,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.98ms. Allocated memory is still 77.6MB. Free memory was 47.7MB in the beginning and 53.1MB in the end (delta: -5.4MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-09-08 19:36:20,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.79ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 50.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 19:36:20,700 INFO L158 Benchmark]: Boogie Preprocessor took 29.80ms. Allocated memory is still 77.6MB. Free memory was 50.9MB in the beginning and 49.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 19:36:20,700 INFO L158 Benchmark]: RCFGBuilder took 606.63ms. Allocated memory is still 77.6MB. Free memory was 48.9MB in the beginning and 50.1MB in the end (delta: -1.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2024-09-08 19:36:20,700 INFO L158 Benchmark]: TraceAbstraction took 160410.15ms. Allocated memory was 77.6MB in the beginning and 163.6MB in the end (delta: 86.0MB). Free memory was 49.2MB in the beginning and 96.4MB in the end (delta: -47.3MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2024-09-08 19:36:20,701 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 58.7MB. Free memory was 30.4MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.98ms. Allocated memory is still 77.6MB. Free memory was 47.7MB in the beginning and 53.1MB in the end (delta: -5.4MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.79ms. Allocated memory is still 77.6MB. Free memory was 53.1MB in the beginning and 50.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.80ms. Allocated memory is still 77.6MB. Free memory was 50.9MB in the beginning and 49.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 606.63ms. Allocated memory is still 77.6MB. Free memory was 48.9MB in the beginning and 50.1MB in the end (delta: -1.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 160410.15ms. Allocated memory was 77.6MB in the beginning and 163.6MB in the end (delta: 86.0MB). Free memory was 49.2MB in the beginning and 96.4MB in the end (delta: -47.3MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 234, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 38, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 256, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 32, dependent conditional: 22, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 69, independent unconditional: 155, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 136, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 136, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 61, independent conditional: 0, independent unconditional: 61, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 234, independent: 98, independent conditional: 0, independent unconditional: 98, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 136, unknown conditional: 0, unknown unconditional: 136] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 0, Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 159, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, Independence queries for same thread: 12, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 17, Number of trivial persistent sets: 16, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 171, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 17, dependent conditional: 12, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 33, independent unconditional: 121, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 159, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 33, Maximal queried relation: 0, Independence queries for same thread: 12 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 505, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 471, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, Independence queries for same thread: 34, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 41, Number of trivial persistent sets: 38, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 379, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 505, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 53, dependent conditional: 34, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 92, independent unconditional: 360, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 471, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 325, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 325, independent: 298, independent conditional: 0, independent unconditional: 298, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 471, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 325, unknown conditional: 0, unknown unconditional: 325] , Statistics on independence cache: Total cache size (in pairs): 325, Positive cache size: 306, Positive conditional cache size: 0, Positive unconditional cache size: 306, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 0, Independence queries for same thread: 34 - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-08 19:36:20,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (15)] Forceful destruction successful, exit code 0 [2024-09-08 19:36:20,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Forceful destruction successful, exit code 0 [2024-09-08 19:36:21,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-09-08 19:36:21,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-09-08 19:36:21,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index