./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:18:58,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:18:58,926 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-08 12:18:58,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:18:58,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:18:58,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:18:58,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:18:58,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:18:58,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:18:58,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:18:58,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:18:58,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:18:58,973 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:18:58,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:18:58,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:18:58,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:18:58,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:18:58,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:18:58,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:18:58,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:18:58,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:18:58,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:18:58,983 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 12:18:58,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:18:58,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 12:18:58,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:18:58,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:18:58,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:18:58,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:18:58,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:18:58,987 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-08 12:18:58,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:18:58,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:18:58,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:18:58,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:18:58,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:18:58,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:18:58,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:18:58,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:18:58,991 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-08 12:18:58,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:18:58,992 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:18:58,993 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:18:58,993 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL 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 ! data-race) ) 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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2024-11-08 12:18:59,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:18:59,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:18:59,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:18:59,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:18:59,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:18:59,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i Unable to find full path for "g++" [2024-11-08 12:19:01,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:19:02,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:19:02,027 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2024-11-08 12:19:02,053 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/data/e6effce47/30c379a0db224ba2996d6b193ca0fe13/FLAGe6406b2ea [2024-11-08 12:19:02,317 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/data/e6effce47/30c379a0db224ba2996d6b193ca0fe13 [2024-11-08 12:19:02,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:19:02,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:19:02,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:19:02,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:19:02,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:19:02,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:19:02" (1/1) ... [2024-11-08 12:19:02,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a27e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:02, skipping insertion in model container [2024-11-08 12:19:02,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:19:02" (1/1) ... [2024-11-08 12:19:02,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:19:03,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:19:03,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:19:03,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:19:03,387 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:19:03,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03 WrapperNode [2024-11-08 12:19:03,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:19:03,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:19:03,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:19:03,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:19:03,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,459 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 176 [2024-11-08 12:19:03,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:19:03,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:19:03,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:19:03,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:19:03,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:19:03,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:19:03,523 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:19:03,523 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:19:03,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (1/1) ... [2024-11-08 12:19:03,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:19:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:03,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:19:03,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:19:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-08 12:19:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 12:19:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 12:19:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-08 12:19:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:19:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-08 12:19:03,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-08 12:19:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 12:19:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:19:03,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:19:03,623 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:19:03,807 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:19:03,810 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:19:04,387 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:19:04,388 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:19:04,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:19:04,437 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:19:04,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:04 BoogieIcfgContainer [2024-11-08 12:19:04,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:19:04,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:19:04,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:19:04,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:19:04,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:19:02" (1/3) ... [2024-11-08 12:19:04,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1e962c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:19:04, skipping insertion in model container [2024-11-08 12:19:04,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:03" (2/3) ... [2024-11-08 12:19:04,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1e962c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:19:04, skipping insertion in model container [2024-11-08 12:19:04,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:04" (3/3) ... [2024-11-08 12:19:04,450 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2024-11-08 12:19:04,471 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:19:04,471 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-08 12:19:04,471 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:19:04,570 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:19:04,644 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:19:04,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:19:04,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:04,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:19:04,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:19:04,695 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:19:04,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-11-08 12:19:04,721 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a4ba4a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:19:04,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 12:19:05,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:05,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1495603272, now seen corresponding path program 1 times [2024-11-08 12:19:05,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:05,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715845021] [2024-11-08 12:19:05,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:05,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:05,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715845021] [2024-11-08 12:19:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715845021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:19:05,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:19:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:19:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133628620] [2024-11-08 12:19:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:19:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:19:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:05,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:19:05,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:19:05,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:06,001 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:06,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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-11-08 12:19:06,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:06,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:19:06,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:06,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash -263909244, now seen corresponding path program 1 times [2024-11-08 12:19:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:06,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112175866] [2024-11-08 12:19:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112175866] [2024-11-08 12:19:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112175866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:06,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920464668] [2024-11-08 12:19:06,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:06,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:06,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:06,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:06,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:19:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:06,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 12:19:06,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:06,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920464668] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:06,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-08 12:19:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869923076] [2024-11-08 12:19:06,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:06,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:19:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:19:06,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:19:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:06,797 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:06,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 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-11-08 12:19:06,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:07,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:07,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 12:19:07,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-08 12:19:07,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:07,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1725797892, now seen corresponding path program 2 times [2024-11-08 12:19:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071331322] [2024-11-08 12:19:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:07,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:07,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071331322] [2024-11-08 12:19:07,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071331322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:07,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029480844] [2024-11-08 12:19:07,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:19:07,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:07,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:07,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:07,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:19:07,723 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 12:19:07,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:19:07,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 12:19:07,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:07,793 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-11-08 12:19:07,822 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 21 treesize of output 20 [2024-11-08 12:19:07,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:19:07,879 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 12:19:07,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:19:07,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2024-11-08 12:19:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 12:19:08,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:19:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029480844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:19:08,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 12:19:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-08 12:19:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125002180] [2024-11-08 12:19:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:19:08,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:19:08,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:08,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:19:08,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-08 12:19:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:08,010 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:08,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 6 states have internal predecessors, (97), 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-11-08 12:19:08,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:08,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:08,011 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:08,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 12:19:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 12:19:09,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash -47627135, now seen corresponding path program 1 times [2024-11-08 12:19:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160847029] [2024-11-08 12:19:09,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:09,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:09,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:09,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160847029] [2024-11-08 12:19:09,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160847029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:09,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752511789] [2024-11-08 12:19:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:09,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:09,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:09,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:19:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:09,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:19:09,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:09,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752511789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:09,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:09,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-08 12:19:09,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271325890] [2024-11-08 12:19:09,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:09,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 12:19:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:09,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 12:19:09,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-08 12:19:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:09,793 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:09,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.944444444444445) internal successors, (143), 18 states have internal predecessors, (143), 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-11-08 12:19:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:09,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:10,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 12:19:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:10,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:10,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:10,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1662211215, now seen corresponding path program 2 times [2024-11-08 12:19:10,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:10,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047092344] [2024-11-08 12:19:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:10,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047092344] [2024-11-08 12:19:10,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047092344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:10,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027479920] [2024-11-08 12:19:10,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:19:10,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:10,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:10,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:10,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 12:19:11,114 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 12:19:11,115 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:19:11,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 12:19:11,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:11,146 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-11-08 12:19:11,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 12:19:11,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:19:11,225 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 12:19:11,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:19:11,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2024-11-08 12:19:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-08 12:19:11,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:19:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027479920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:19:11,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 12:19:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-11-08 12:19:11,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674201209] [2024-11-08 12:19:11,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:19:11,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 12:19:11,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:11,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 12:19:11,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-08 12:19:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:11,347 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:11,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.0) internal successors, (105), 6 states have internal predecessors, (105), 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-11-08 12:19:11,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:11,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:11,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:11,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:11,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:11,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 12:19:12,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:12,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:12,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:12,120 INFO L85 PathProgramCache]: Analyzing trace with hash 379940632, now seen corresponding path program 1 times [2024-11-08 12:19:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:12,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928250644] [2024-11-08 12:19:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-08 12:19:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:12,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928250644] [2024-11-08 12:19:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928250644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:19:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:19:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:19:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283712305] [2024-11-08 12:19:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:19:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:19:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:12,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:19:12,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:19:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:12,276 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:12,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:19:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:12,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:12,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:12,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:19:12,652 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:12,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:12,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1599613202, now seen corresponding path program 1 times [2024-11-08 12:19:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:12,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220363038] [2024-11-08 12:19:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220363038] [2024-11-08 12:19:13,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220363038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:13,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316965870] [2024-11-08 12:19:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:13,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:13,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:13,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:13,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:19:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:13,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 12:19:13,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:13,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:19:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316965870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:14,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:14,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2024-11-08 12:19:14,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642074916] [2024-11-08 12:19:14,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:14,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 12:19:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:14,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 12:19:14,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-08 12:19:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:14,019 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:14,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 23 states have internal predecessors, (173), 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-11-08 12:19:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:14,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 12:19:14,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:14,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:14,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1135167546, now seen corresponding path program 2 times [2024-11-08 12:19:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996359289] [2024-11-08 12:19:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:14,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:19:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996359289] [2024-11-08 12:19:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996359289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:19:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:19:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 12:19:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215117811] [2024-11-08 12:19:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:19:15,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 12:19:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 12:19:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:19:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:15,797 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:15,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 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-11-08 12:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:15,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:15,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:15,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:15,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:15,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:15,799 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 12:19:17,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:17,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1048852836, now seen corresponding path program 1 times [2024-11-08 12:19:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:17,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170787261] [2024-11-08 12:19:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:19:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170787261] [2024-11-08 12:19:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170787261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:20,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239625973] [2024-11-08 12:19:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:20,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:20,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:20,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 12:19:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:20,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 12:19:20,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:21,687 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-11-08 12:19:21,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 12:19:21,839 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 30 treesize of output 32 [2024-11-08 12:19:21,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 12:19:22,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:22,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:22,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:22,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-08 12:19:22,240 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 37 proven. 36 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:19:22,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 24 proven. 49 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:19:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239625973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:23,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:23,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 46 [2024-11-08 12:19:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776261025] [2024-11-08 12:19:23,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:23,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 12:19:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:23,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 12:19:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1926, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 12:19:23,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:23,932 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:23,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 9.782608695652174) internal successors, (450), 47 states have internal predecessors, (450), 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-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:23,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:28,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 12:19:28,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:28,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:28,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1463116902, now seen corresponding path program 1 times [2024-11-08 12:19:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:28,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593499075] [2024-11-08 12:19:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 12:19:28,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593499075] [2024-11-08 12:19:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593499075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246978135] [2024-11-08 12:19:28,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:28,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:28,901 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:28,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 12:19:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:29,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 12:19:29,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 12:19:29,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 132 proven. 1 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 12:19:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246978135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:29,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-08 12:19:29,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840582411] [2024-11-08 12:19:29,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:29,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 12:19:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 12:19:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:19:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:29,447 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:29,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.9) internal successors, (339), 10 states have internal predecessors, (339), 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-11-08 12:19:29,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:29,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:29,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:29,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:29,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 12:19:29,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 12:19:29,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash -151925886, now seen corresponding path program 1 times [2024-11-08 12:19:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006786220] [2024-11-08 12:19:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:29,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 25 proven. 140 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:19:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006786220] [2024-11-08 12:19:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006786220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662735126] [2024-11-08 12:19:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:33,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:33,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:33,149 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:33,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 12:19:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:33,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 12:19:33,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:35,282 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-11-08 12:19:35,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 12:19:35,490 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 30 treesize of output 32 [2024-11-08 12:19:35,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 12:19:35,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:35,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:35,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:35,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:35,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-08 12:19:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 92 proven. 73 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:19:35,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 24 proven. 138 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-08 12:19:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662735126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:37,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:37,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 19] total 56 [2024-11-08 12:19:37,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235212657] [2024-11-08 12:19:37,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:37,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-08 12:19:37,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:37,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-08 12:19:37,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2892, Unknown=0, NotChecked=0, Total=3192 [2024-11-08 12:19:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:37,773 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:37,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 11.321428571428571) internal successors, (634), 57 states have internal predecessors, (634), 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-11-08 12:19:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:37,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:37,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:37,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:37,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:37,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:37,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:37,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:37,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:44,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:44,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:19:44,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 12:19:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 12:19:44,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash -892394206, now seen corresponding path program 2 times [2024-11-08 12:19:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189741621] [2024-11-08 12:19:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 298 proven. 189 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 12:19:45,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189741621] [2024-11-08 12:19:45,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189741621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:45,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393262107] [2024-11-08 12:19:45,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:19:45,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:45,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:45,428 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:45,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 12:19:45,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:19:45,894 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:19:45,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:19:45,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 298 proven. 189 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 12:19:46,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 298 proven. 189 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 12:19:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393262107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:46,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:46,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-08 12:19:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471963205] [2024-11-08 12:19:46,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:46,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 12:19:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 12:19:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-08 12:19:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:46,565 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:46,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 32.611111111111114) internal successors, (587), 18 states have internal predecessors, (587), 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-11-08 12:19:46,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:46,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:46,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:46,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:46,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:46,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:46,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:46,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:46,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:46,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:46,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:19:46,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:19:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:47,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 12:19:47,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 12:19:47,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:19:47,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:19:47,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1768185702, now seen corresponding path program 3 times [2024-11-08 12:19:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:19:47,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594493513] [2024-11-08 12:19:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:19:47,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:19:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:19:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2243 backedges. 630 proven. 1309 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2024-11-08 12:19:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:19:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594493513] [2024-11-08 12:19:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594493513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:19:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711491646] [2024-11-08 12:19:49,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 12:19:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:19:49,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:19:49,244 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:19:49,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 12:19:49,686 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 12:19:49,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:19:49,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 12:19:49,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:19:51,010 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 13 treesize of output 9 [2024-11-08 12:19:51,067 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2024-11-08 12:19:51,067 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 1 case distinctions, treesize of input 29 treesize of output 19 [2024-11-08 12:19:51,488 INFO L349 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2024-11-08 12:19:51,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2024-11-08 12:19:51,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2024-11-08 12:19:51,785 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 21 treesize of output 20 [2024-11-08 12:19:51,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 12:19:51,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 12:19:52,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:52,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:52,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:19:52,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 47 [2024-11-08 12:19:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2243 backedges. 544 proven. 26 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2024-11-08 12:19:52,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:19:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2243 backedges. 566 proven. 4 refuted. 0 times theorem prover too weak. 1673 trivial. 0 not checked. [2024-11-08 12:19:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711491646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:19:54,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:19:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 15] total 46 [2024-11-08 12:19:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579199865] [2024-11-08 12:19:54,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:19:54,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-08 12:19:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:19:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-08 12:19:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1840, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 12:19:54,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:19:54,611 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:19:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 20.065217391304348) internal successors, (923), 46 states have internal predecessors, (923), 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-11-08 12:19:54,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:19:54,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:19:54,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:19:54,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:19:54,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:19:54,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:20:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:20:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:08,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:20:08,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 12:20:09,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 12:20:09,077 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:20:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:20:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1063799454, now seen corresponding path program 1 times [2024-11-08 12:20:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:20:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484972891] [2024-11-08 12:20:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:20:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:20:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:20:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 2754 proven. 1744 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2024-11-08 12:20:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:20:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484972891] [2024-11-08 12:20:12,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484972891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:20:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883776637] [2024-11-08 12:20:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:20:12,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:20:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:20:12,244 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:20:12,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 12:20:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:20:13,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 2724 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 12:20:13,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:20:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 2754 proven. 1744 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2024-11-08 12:20:13,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:20:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 2754 proven. 1744 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2024-11-08 12:20:14,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883776637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:20:14,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:20:14,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2024-11-08 12:20:14,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952317565] [2024-11-08 12:20:14,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:20:14,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 12:20:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:20:14,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 12:20:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-08 12:20:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:20:14,812 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:20:14,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 34.26086956521739) internal successors, (788), 23 states have internal predecessors, (788), 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-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:14,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:20:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:20:14,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:20:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:20:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:20:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:20:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:15,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 12:20:15,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 12:20:15,723 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:20:15,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:20:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -939699622, now seen corresponding path program 2 times [2024-11-08 12:20:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:20:15,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809768393] [2024-11-08 12:20:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:20:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:20:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:20:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7233 backedges. 6412 proven. 541 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:20:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:20:21,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809768393] [2024-11-08 12:20:21,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809768393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:20:21,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366722244] [2024-11-08 12:20:21,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:20:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:20:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:20:21,585 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:20:21,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 12:20:22,607 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:20:22,608 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:20:22,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 3100 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 12:20:22,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:20:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 7233 backedges. 5703 proven. 0 refuted. 0 times theorem prover too weak. 1530 trivial. 0 not checked. [2024-11-08 12:20:23,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:20:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366722244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:20:23,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 12:20:23,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [41] total 43 [2024-11-08 12:20:23,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016880160] [2024-11-08 12:20:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:20:23,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 12:20:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:20:23,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 12:20:23,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=1360, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 12:20:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:20:23,641 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:20:23,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 31.782608695652176) internal successors, (731), 23 states have internal predecessors, (731), 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-11-08 12:20:23,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:23,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:23,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-11-08 12:20:23,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:23,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:20:23,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:23,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:20:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 12:20:25,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 12:20:25,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 12:20:25,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:20:25,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:20:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash 945361712, now seen corresponding path program 2 times [2024-11-08 12:20:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:20:25,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971297428] [2024-11-08 12:20:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:20:25,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:20:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:20:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 900 proven. 405 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:20:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:20:30,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971297428] [2024-11-08 12:20:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971297428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:20:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509543703] [2024-11-08 12:20:30,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:20:30,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:20:30,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:20:30,046 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:20:30,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 12:20:30,536 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 12:20:30,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:20:30,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 12:20:30,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:20:31,353 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 13 treesize of output 9 [2024-11-08 12:20:31,537 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-11-08 12:20:31,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 12:20:31,703 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 30 treesize of output 32 [2024-11-08 12:20:31,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 12:20:32,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 12:20:32,489 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 19 treesize of output 11 [2024-11-08 12:20:32,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2024-11-08 12:20:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 1423 trivial. 0 not checked. [2024-11-08 12:20:32,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:20:34,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:34,432 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 14 treesize of output 8 [2024-11-08 12:20:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 1423 trivial. 0 not checked. [2024-11-08 12:20:34,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509543703] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 12:20:34,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:20:34,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [30, 14] total 54 [2024-11-08 12:20:34,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988885387] [2024-11-08 12:20:34,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:20:34,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:20:34,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:20:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:20:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2672, Unknown=0, NotChecked=0, Total=2970 [2024-11-08 12:20:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:20:34,644 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:20:34,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.23076923076923) internal successors, (146), 14 states have internal predecessors, (146), 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-11-08 12:20:34,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:34,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-08 12:20:34,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:34,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:20:34,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:34,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:20:34,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:34,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-08 12:20:34,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:20:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:20:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 12:20:38,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 12:20:38,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 12:20:38,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 12:20:38,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:20:38,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:20:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash -758561359, now seen corresponding path program 1 times [2024-11-08 12:20:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:20:38,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011914131] [2024-11-08 12:20:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:20:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:20:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:20:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 900 proven. 405 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:20:43,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:20:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011914131] [2024-11-08 12:20:43,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011914131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:20:43,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931688995] [2024-11-08 12:20:43,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:20:43,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:20:43,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:20:43,427 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:20:43,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 12:20:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:20:44,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 12:20:44,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:20:46,044 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-11-08 12:20:46,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 12:20:46,188 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 30 treesize of output 32 [2024-11-08 12:20:46,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 12:20:46,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-08 12:20:46,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:20:46,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2024-11-08 12:20:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 1143 proven. 162 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:20:47,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:21:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 1143 proven. 162 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:21:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931688995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:21:17,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:21:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 31] total 89 [2024-11-08 12:21:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762951712] [2024-11-08 12:21:17,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:21:17,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2024-11-08 12:21:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:21:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2024-11-08 12:21:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=7029, Unknown=6, NotChecked=0, Total=8010 [2024-11-08 12:21:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:21:17,508 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:21:17,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 89 states have (on average 12.370786516853933) internal successors, (1101), 90 states have internal predecessors, (1101), 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-11-08 12:21:17,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:21:17,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:21:17,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:21:17,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:21:17,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:21:17,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2024-11-08 12:21:17,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:21:17,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-08 12:21:17,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-11-08 12:21:17,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:21:26,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:21:36,444 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-11-08 12:21:38,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:21:54,975 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-11-08 12:22:04,344 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-11-08 12:22:06,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:22:28,385 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-11-08 12:22:32,080 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-11-08 12:23:30,468 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-11-08 12:23:31,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:23:42,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:24:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:24:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:24:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:24:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:24:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:24:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:24:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 12:24:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 12:24:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-11-08 12:24:39,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-08 12:24:39,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 12:24:39,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:24:39,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:24:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash -365875834, now seen corresponding path program 2 times [2024-11-08 12:24:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:24:39,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814710534] [2024-11-08 12:24:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:24:39,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:24:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:24:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 900 proven. 414 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:24:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:24:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814710534] [2024-11-08 12:24:48,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814710534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:24:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944972544] [2024-11-08 12:24:48,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:24:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:24:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:24:48,559 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:24:48,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f942e98c-fc8e-4996-a0bc-5926912197b8/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 12:24:49,239 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:24:49,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:24:49,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-08 12:24:49,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:24:52,024 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-11-08 12:24:52,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-08 12:24:52,229 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 30 treesize of output 32 [2024-11-08 12:24:52,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-08 12:24:53,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-08 12:24:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2024-11-08 12:24:53,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2024-11-08 12:24:53,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:53,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2024-11-08 12:24:54,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 81 [2024-11-08 12:24:54,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:54,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2024-11-08 12:24:55,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 90 [2024-11-08 12:24:55,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:24:55,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2024-11-08 12:25:43,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 12:25:43,438 INFO L349 Elim1Store]: treesize reduction 44, result has 48.8 percent of original size [2024-11-08 12:25:43,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 101 [2024-11-08 12:25:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 1143 proven. 171 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-11-08 12:25:51,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:25:58,472 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_#t~post39#1|)))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))))) is different from false [2024-11-08 12:26:00,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_~#cache~0.base|)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))))) is different from false [2024-11-08 12:26:02,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))) is different from false [2024-11-08 12:26:04,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 .cse2 v_ArrVal_6421)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse3 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))))) is different from false [2024-11-08 12:26:07,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 .cse3 v_ArrVal_6421)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 .cse3 v_ArrVal_6421)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 .cse3 v_ArrVal_6421)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse2 .cse3 v_ArrVal_6421)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))) is different from false [2024-11-08 12:26:09,147 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 v_ArrVal_6421)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse5 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (< .cse5 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 v_ArrVal_6421)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 v_ArrVal_6421)))) (store .cse7 |c_~#cache~0.base| (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse5 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 v_ArrVal_6421)))) (store .cse8 |c_~#cache~0.base| (store (select .cse8 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse5 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))))) is different from false [2024-11-08 12:26:11,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (< |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (< |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (< |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int)) (or (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.base| (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|))) (< |c_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))))) is different from false [2024-11-08 12:26:14,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ .cse3 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse2 (+ .cse3 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse1 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|)))))) is different from false [2024-11-08 12:26:28,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))))) is different from false [2024-11-08 12:27:12,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3)) (.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse5 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (store (select .cse1 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse6 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse5 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (let ((.cse7 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse5 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse7 |c_~#cache~0.base| (store (store (store (store (store (select .cse7 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (let ((.cse8 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse4 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse5 |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse8 |c_~#cache~0.base| (store (store (store (store (store (select .cse8 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))))) is different from false [2024-11-08 12:27:13,925 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 15082 treesize of output 15078 [2024-11-08 12:27:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1594 backedges. 1143 proven. 117 refuted. 0 times theorem prover too weak. 280 trivial. 54 not checked. [2024-11-08 12:27:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944972544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:27:33,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:27:33,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 43, 39] total 110 [2024-11-08 12:27:33,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342293397] [2024-11-08 12:27:33,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:27:33,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2024-11-08 12:27:33,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:27:33,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2024-11-08 12:27:33,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1221, Invalid=8870, Unknown=49, NotChecked=2070, Total=12210 [2024-11-08 12:27:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:27:33,665 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:27:33,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 10.545454545454545) internal successors, (1160), 111 states have internal predecessors, (1160), 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-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:27:33,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-11-08 12:27:33,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:28:53,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:28:56,057 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse8 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse8 .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store .cse8 .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse5 (select .cse4 |c_~#cache~0.base|))) (and (or (not (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (< .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (or (< .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (not (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from true [2024-11-08 12:29:20,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:22,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:23,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:25,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:27,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:30,820 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse4 (select .cse3 |c_~#cache~0.base|)) (.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from true [2024-11-08 12:29:32,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:29:34,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:12,662 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse8 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse8 .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store .cse8 .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse5 (select .cse4 |c_~#cache~0.base|))) (and (or (not (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (< .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (or (< .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (not (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))))) is different from true [2024-11-08 12:30:38,982 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-11-08 12:30:41,050 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-11-08 12:30:43,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:30:45,970 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse4 (select .cse3 |c_~#cache~0.base|)) (.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse3 |c_~#cache~0.base| (store (store (store (store (store .cse4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store |c_#race| |c_~#cache~0.base| (store (store (store (store (store .cse0 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))))) is different from true [2024-11-08 12:30:48,982 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse8 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse8 .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store .cse8 .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse5 (select .cse4 |c_~#cache~0.base|))) (and (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))))) is different from true [2024-11-08 12:31:13,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:16,033 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse8 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store .cse8 .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (.cse1 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store .cse8 .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse5 (select .cse4 |c_~#cache~0.base|))) (and (or (not (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (< .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (<= 4 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (or (< .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (not (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse1 |c_~#cache~0.base| (store (store (store (store (store .cse2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse0 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse4 |c_~#cache~0.base| (store (store (store (store (store .cse5 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))))) is different from true [2024-11-08 12:31:18,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (let ((.cse2 (+ 28 |c_~#cache~0.offset|)) (.cse1 (select .cse0 |c_~#cache~0.base|))) (and (<= 4 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|))) (forall ((|v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| Int) (|ULTIMATE.start_cache_entry_addref_#t~nondet33#1| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| Int) (v_ArrVal_6421 Int)) (or (< .cse2 |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36|) (< |c_~#cache~0.offset| |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) (= (select (select (store .cse0 |c_~#cache~0.base| (store (store (store (store (store .cse1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82| |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 1 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 2 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) |ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (+ 3 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_82|) v_ArrVal_6421) |v_ULTIMATE.start_cache_entry_addref_#in~entry#1.offset_36| 0)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|))))))) is different from false [2024-11-08 12:31:35,403 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-11-08 12:31:37,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:39,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:41,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:43,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:47,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:49,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:51,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:53,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:55,486 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-11-08 12:31:57,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:31:59,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:01,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:03,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:05,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:07,533 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-11-08 12:32:09,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:11,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:13,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:15,564 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-11-08 12:32:17,569 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-11-08 12:32:19,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:21,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:23,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:25,596 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-11-08 12:32:27,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:29,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:31,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:33,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:35,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:37,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:39,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:41,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:43,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, 1] [2024-11-08 12:32:45,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:47,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:49,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:51,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:53,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:55,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:57,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:32:59,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:01,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:03,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:05,763 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-11-08 12:33:07,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:09,782 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-11-08 12:33:11,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:13,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:15,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:17,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:19,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:21,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:33:23,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]