./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 2329fc70 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_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w --witnessprinter.witness.filename witness.graphml --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 a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 06:59:06,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:59:06,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:59:06,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:59:06,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:59:06,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:59:06,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:59:06,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:59:06,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:59:06,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:59:06,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:59:06,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:59:06,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:59:06,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:59:06,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:59:06,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:59:06,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:59:06,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:59:06,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:59:06,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:59:06,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:59:06,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:59:06,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:59:06,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:59:06,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:59:06,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:59:06,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:59:06,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:59:06,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:59:06,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:59:06,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:59:06,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:59:06,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:59:06,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:59:06,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:59:06,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:59:06,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:59:06,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:59:06,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:59:06,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:59:06,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:59:06,525 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-12-13 06:59:06,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:59:06,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:59:06,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 06:59:06,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 06:59:06,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 06:59:06,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 06:59:06,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:59:06,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:59:06,541 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:59:06,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:59:06,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:59:06,541 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 06:59:06,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:59:06,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:59:06,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:59:06,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:59:06,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:59:06,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:59:06,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:59:06,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:59:06,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:59:06,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:59:06,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:59:06,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:59:06,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:59:06,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:59:06,544 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 06:59:06,544 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-12-13 06:59:06,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 06:59:06,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 06:59:06,545 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 06:59:06,545 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 06:59:06,545 INFO L138 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_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/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_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a98c974c803b808e0d7e2f56f44a4386aecc7f9a41003cc6d1be849c6b132112 [2022-12-13 06:59:06,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:59:06,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:59:06,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:59:06,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:59:06,763 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:59:06,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2022-12-13 06:59:09,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:59:09,543 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:59:09,544 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/sv-benchmarks/c/goblint-regression/09-regions_26-alloc_region_rc.i [2022-12-13 06:59:09,558 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/data/ab48decf7/9c34c319e8cd4feeab931ac524982d8d/FLAG3f6923c34 [2022-12-13 06:59:09,878 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/data/ab48decf7/9c34c319e8cd4feeab931ac524982d8d [2022-12-13 06:59:09,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:59:09,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 06:59:09,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:59:09,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:59:09,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:59:09,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:59:09" (1/1) ... [2022-12-13 06:59:09,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e8821b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:09, skipping insertion in model container [2022-12-13 06:59:09,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:59:09" (1/1) ... [2022-12-13 06:59:09,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:59:09,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:59:10,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:59:10,290 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:59:10,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:59:10,398 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:59:10,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10 WrapperNode [2022-12-13 06:59:10,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:59:10,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:59:10,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:59:10,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:59:10,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,452 INFO L138 Inliner]: procedures = 370, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 236 [2022-12-13 06:59:10,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:59:10,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:59:10,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:59:10,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:59:10,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,481 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:59:10,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:59:10,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:59:10,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:59:10,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (1/1) ... [2022-12-13 06:59:10,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:59:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 06:59:10,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 06:59:10,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 06:59:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:59:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 06:59:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:59:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 06:59:10,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 06:59:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:59:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 06:59:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 06:59:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:59:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 06:59:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 06:59:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 06:59:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:59:10,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:59:10,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:59:10,549 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 06:59:10,699 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 06:59:10,701 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:59:11,053 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 06:59:11,062 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:59:11,062 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 06:59:11,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:59:11 BoogieIcfgContainer [2022-12-13 06:59:11,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:59:11,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:59:11,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:59:11,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:59:11,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:59:09" (1/3) ... [2022-12-13 06:59:11,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dcb2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:59:11, skipping insertion in model container [2022-12-13 06:59:11,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:59:10" (2/3) ... [2022-12-13 06:59:11,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dcb2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:59:11, skipping insertion in model container [2022-12-13 06:59:11,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:59:11" (3/3) ... [2022-12-13 06:59:11,070 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.i [2022-12-13 06:59:11,076 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 06:59:11,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:59:11,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-12-13 06:59:11,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:59:11,136 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 06:59:11,170 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:59:11,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 06:59:11,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 06:59:11,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 06:59:11,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 06:59:11,205 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 06:59:11,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-12-13 06:59:11,218 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3d8faf5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:59:11,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 06:59:11,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1558104970, now seen corresponding path program 1 times [2022-12-13 06:59:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:11,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583483009] [2022-12-13 06:59:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:12,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583483009] [2022-12-13 06:59:12,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583483009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:12,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:12,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:59:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988442744] [2022-12-13 06:59:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:12,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:59:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:12,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:59:12,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:59:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:12,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:12,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 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) [2022-12-13 06:59:12,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:12,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:59:12,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 813545999, now seen corresponding path program 1 times [2022-12-13 06:59:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:12,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989871243] [2022-12-13 06:59:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:12,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989871243] [2022-12-13 06:59:12,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989871243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:12,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:12,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:59:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54768417] [2022-12-13 06:59:12,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:12,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:59:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:59:12,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:59:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:12,887 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:12,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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) [2022-12-13 06:59:12,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:12,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:13,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:59:13,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1452261213, now seen corresponding path program 1 times [2022-12-13 06:59:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:13,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176090172] [2022-12-13 06:59:13,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:13,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:13,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:13,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176090172] [2022-12-13 06:59:13,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176090172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:13,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:13,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:59:13,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988379054] [2022-12-13 06:59:13,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:13,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:59:13,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:13,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:59:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:59:13,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:13,653 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:13,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 6 states have internal predecessors, (109), 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) [2022-12-13 06:59:13,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:13,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:13,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:59:13,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1441201381, now seen corresponding path program 1 times [2022-12-13 06:59:13,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:13,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391544928] [2022-12-13 06:59:13,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:14,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391544928] [2022-12-13 06:59:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391544928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:14,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:59:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5379788] [2022-12-13 06:59:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:59:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:14,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:59:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:59:14,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:14,247 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:14,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:59:14,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:59:14,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2065861300, now seen corresponding path program 1 times [2022-12-13 06:59:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481258539] [2022-12-13 06:59:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:14,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481258539] [2022-12-13 06:59:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481258539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:14,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:14,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:59:14,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720389911] [2022-12-13 06:59:14,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:14,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:59:14,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:59:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:59:14,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:14,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:14,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:59:14,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:14,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:59:15,147 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash 849114854, now seen corresponding path program 1 times [2022-12-13 06:59:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:15,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955058970] [2022-12-13 06:59:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:15,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955058970] [2022-12-13 06:59:15,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955058970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:15,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:15,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:59:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626682960] [2022-12-13 06:59:15,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:15,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:59:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:15,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:59:15,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:59:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:15,536 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:15,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.2) internal successors, (136), 6 states have internal predecessors, (136), 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) [2022-12-13 06:59:15,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:15,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:59:15,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash 130749675, now seen corresponding path program 1 times [2022-12-13 06:59:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:15,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604376981] [2022-12-13 06:59:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:16,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604376981] [2022-12-13 06:59:16,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604376981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:16,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:16,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 06:59:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102796598] [2022-12-13 06:59:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:16,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 06:59:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:16,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 06:59:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 06:59:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:16,165 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:16,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.8) internal successors, (144), 6 states have internal predecessors, (144), 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) [2022-12-13 06:59:16,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,166 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:16,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:59:16,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1999563638, now seen corresponding path program 1 times [2022-12-13 06:59:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:16,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462639892] [2022-12-13 06:59:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:17,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462639892] [2022-12-13 06:59:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462639892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:17,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-13 06:59:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973896538] [2022-12-13 06:59:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:17,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 06:59:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 06:59:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 06:59:17,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:17,147 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:17,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 13.083333333333334) internal successors, (157), 13 states have internal predecessors, (157), 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) [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:59:17,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 06:59:17,781 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1938197544, now seen corresponding path program 1 times [2022-12-13 06:59:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:17,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492056027] [2022-12-13 06:59:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:19,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:19,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492056027] [2022-12-13 06:59:19,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492056027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:19,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:19,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-12-13 06:59:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684623318] [2022-12-13 06:59:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:19,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 06:59:19,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:19,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 06:59:19,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-12-13 06:59:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:19,856 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:19,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.5) internal successors, (180), 25 states have internal predecessors, (180), 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) [2022-12-13 06:59:19,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:19,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:19,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:19,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:19,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:19,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:19,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:19,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:59:19,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:59:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 06:59:23,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 06:59:23,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash -213673970, now seen corresponding path program 1 times [2022-12-13 06:59:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:23,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210290406] [2022-12-13 06:59:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:25,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:25,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210290406] [2022-12-13 06:59:25,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210290406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:25,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:25,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-12-13 06:59:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048247580] [2022-12-13 06:59:25,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:25,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 06:59:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 06:59:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-12-13 06:59:25,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:25,229 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:25,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.48) internal successors, (187), 26 states have internal predecessors, (187), 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) [2022-12-13 06:59:25,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:25,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:25,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:25,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:25,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:25,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:25,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:25,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:59:25,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 06:59:25,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:59:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 06:59:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 06:59:26,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 06:59:26,860 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash -218544017, now seen corresponding path program 1 times [2022-12-13 06:59:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:26,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125733423] [2022-12-13 06:59:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:29,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125733423] [2022-12-13 06:59:29,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125733423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:59:29,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:59:29,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-12-13 06:59:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692744800] [2022-12-13 06:59:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:59:29,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 06:59:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:59:29,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 06:59:29,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 06:59:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:29,632 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 06:59:29,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 6.71875) internal successors, (215), 33 states have internal predecessors, (215), 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) [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-12-13 06:59:29,633 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 06:59:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 06:59:32,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 06:59:32,393 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr0ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr2ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2022-12-13 06:59:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:59:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1703038714, now seen corresponding path program 1 times [2022-12-13 06:59:32,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:59:32,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430442043] [2022-12-13 06:59:32,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:59:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:59:41,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430442043] [2022-12-13 06:59:41,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430442043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 06:59:41,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826939052] [2022-12-13 06:59:41,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:59:41,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 06:59:41,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 06:59:41,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 06:59:41,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16cd3ae8-5c72-476b-9f2c-46f69cd712bf/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 06:59:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:59:41,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 188 conjunts are in the unsatisfiable core [2022-12-13 06:59:41,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 06:59:42,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:42,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 06:59:42,210 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 06:59:42,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 06:59:42,269 INFO L350 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 [2022-12-13 06:59:42,395 INFO L350 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 25 treesize of output 13 [2022-12-13 06:59:42,860 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 06:59:42,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 06:59:44,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-12-13 06:59:44,289 INFO L350 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 [2022-12-13 06:59:44,804 INFO L350 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 14 treesize of output 16 [2022-12-13 06:59:44,816 INFO L350 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 14 treesize of output 16 [2022-12-13 06:59:44,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-12-13 06:59:45,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:45,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 06:59:45,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:45,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:45,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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 [2022-12-13 06:59:45,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:45,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:45,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:45,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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 [2022-12-13 06:59:45,611 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-13 06:59:45,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-12-13 06:59:46,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:46,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 06:59:46,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:46,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 06:59:46,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:46,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:46,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:46,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:46,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:46,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 06:59:46,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:46,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 06:59:46,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:46,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:46,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:47,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:47,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:47,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:47,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:47,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:48,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:48,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:48,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:48,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:48,228 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-13 06:59:48,243 INFO L350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-12-13 06:59:48,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:48,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:48,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:48,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:48,860 INFO L350 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 32 treesize of output 23 [2022-12-13 06:59:48,872 INFO L350 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 36 treesize of output 27 [2022-12-13 06:59:49,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:49,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:49,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:49,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:49,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:49,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:49,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:49,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:49,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:49,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:50,921 INFO L321 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2022-12-13 06:59:50,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 41 [2022-12-13 06:59:50,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-12-13 06:59:51,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:51,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:51,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:51,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 06:59:51,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:51,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:51,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:51,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:51,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:51,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:51,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 06:59:51,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-12-13 06:59:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 06:59:51,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 06:59:54,131 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_main_#t~mem52#1.offset| |v_ULTIMATE.start_main_~p~1#1.offset_29|)) (forall ((v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_main_#t~mem52#1.offset| |v_ULTIMATE.start_main_~p~1#1.offset_29|)) (forall ((v_ArrVal_2180 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse1 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_main_#t~mem52#1.offset| |v_ULTIMATE.start_main_~p~1#1.offset_29|)) (forall ((v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_main_#t~mem52#1.offset| |v_ULTIMATE.start_main_~p~1#1.offset_29|)) (forall ((v_ArrVal_2180 Int)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))))))) is different from false [2022-12-13 06:59:54,254 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~p~1#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))))) is different from false [2022-12-13 06:59:54,825 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem49#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2180 Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0)))))) is different from false [2022-12-13 06:59:54,887 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~mem49#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem49#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse1 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse3 .cse2 (store (select .cse3 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~mem49#1.base| v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)))))))) is different from false [2022-12-13 06:59:55,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse7)) (.cse0 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse7))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse1 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= (select (select (let ((.cse4 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int)) (or (= (select (select (let ((.cse6 (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0)))))) is different from false [2022-12-13 06:59:55,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse7)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse7))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse0) (= (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) is different from false [2022-12-13 06:59:55,394 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse2 (select (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse8 (+ (select (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse1 (select (select .cse9 .cse2) .cse8)) (.cse3 (select (select .cse7 .cse2) .cse8))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|)) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3) (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3))))))) is different from false [2022-12-13 06:59:55,578 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.offset|))) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (let ((.cse2 (select (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse8 (+ (select (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (let ((.cse1 (select (select .cse9 .cse2) .cse8)) (.cse3 (select (select .cse7 .cse2) .cse8))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse5 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse2 v_ArrVal_2179))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| .cse3))))))) is different from false [2022-12-13 06:59:55,830 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse9 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse6 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse2 (+ (select (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse1 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse0 .cse1) .cse2)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse1 v_ArrVal_2179)) (.cse4 (select (select .cse5 .cse1) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse11 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse17 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse13 (+ (select (select .cse11 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse12 (select (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse11 .cse12) .cse13)) (= (select (select (let ((.cse14 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse12 v_ArrVal_2179)) (.cse15 (select (select .cse16 .cse12) .cse13))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse22 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse26 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse23 (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse24 (+ (select (select .cse25 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse20 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse23 v_ArrVal_2179)) (.cse21 (select (select .cse22 .cse23) .cse24))) (store .cse20 .cse21 (store (select .cse20 .cse21) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse25 .cse23) .cse24))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse36 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse34 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse29 (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse35 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse31 (+ (select (select .cse29 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse30 (select (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse29 .cse30) .cse31)) (= (select (select (let ((.cse32 (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse30 v_ArrVal_2179)) (.cse33 (select (select .cse34 .cse30) .cse31))) (store .cse32 .cse33 (store (select .cse32 .cse33) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))))) is different from false [2022-12-13 06:59:55,986 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse9 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse9 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse6 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse2 (+ (select (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse1 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse0 .cse1) .cse2)) (= (select (select (let ((.cse3 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse1 v_ArrVal_2179)) (.cse4 (select (select .cse5 .cse1) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse16 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse11 (let ((.cse17 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse18 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse17 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse17 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse13 (+ (select (select .cse11 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse12 (select (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse11 .cse12) .cse13)) (= (select (select (let ((.cse14 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse12 v_ArrVal_2179)) (.cse15 (select (select .cse16 .cse12) .cse13))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse27 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse25 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse20 (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse27 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse26 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse26 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse22 (+ (select (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse21 (select (select .cse25 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse20 .cse21) .cse22)) (= (select (select (let ((.cse23 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse21 v_ArrVal_2179)) (.cse24 (select (select .cse25 .cse21) .cse22))) (store .cse23 .cse24 (store (select .cse23 .cse24) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse36 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse34 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse10 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.base|)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse29 (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse36 |c_ULTIMATE.start_insert_#t~mem32#1.offset|)))) (store .cse35 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse35 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse31 (+ (select (select .cse29 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse30 (select (select .cse34 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse29 .cse30) .cse31)) (= (select (select (let ((.cse32 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse30 v_ArrVal_2179)) (.cse33 (select (select .cse34 .cse30) .cse31))) (store .cse32 .cse33 (store (select .cse32 .cse33) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))))) is different from false [2022-12-13 06:59:56,228 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse8 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 .cse9)))) (store .cse6 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse3 (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse4 (+ (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179)) (.cse1 (select (select .cse2 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse5 .cse3) .cse4))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse15 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse20 .cse9)))) (store .cse19 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse16 (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse17 (+ (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse13 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse16 v_ArrVal_2179)) (.cse14 (select (select .cse15 .cse16) .cse17))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse18 .cse16) .cse17))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse24 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse29 .cse9)))) (store .cse28 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse25 (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse26 (+ (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse22 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse25 v_ArrVal_2179)) (.cse23 (select (select .cse24 .cse25) .cse26))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse27 .cse25) .cse26))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse33 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse38 .cse9)))) (store .cse37 |c_ULTIMATE.start_insert_~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_~list#1.base|) |c_ULTIMATE.start_insert_~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|))))) (let ((.cse34 (select (select .cse33 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse35 (+ (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse31 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse34 v_ArrVal_2179)) (.cse32 (select (select .cse33 .cse34) .cse35))) (store .cse31 .cse32 (store (select .cse31 .cse32) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse36 .cse34) .cse35))))))))) is different from false [2022-12-13 06:59:56,349 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse8 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse8 .cse9)))) (store .cse6 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse2 (+ (select (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse1 (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse0 .cse1) .cse2)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse1 v_ArrVal_2179)) (.cse4 (select (select .cse5 .cse1) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse13 (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse20 .cse9)))) (store .cse19 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse15 (+ (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse14 (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse13 .cse14) .cse15)) (= (select (select (let ((.cse16 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse14 v_ArrVal_2179)) (.cse17 (select (select .cse18 .cse14) .cse15))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse22 (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse29 .cse9)))) (store .cse28 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse24 (+ (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse23 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse22 .cse23) .cse24)) (= (select (select (let ((.cse25 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse23 v_ArrVal_2179)) (.cse26 (select (select .cse27 .cse23) .cse24))) (store .cse25 .cse26 (store (select .cse25 .cse26) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_~p#1.base|)))) (.cse31 (let ((.cse37 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_~p#1.base| (store .cse7 .cse38 .cse9)))) (store .cse37 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|))))) (let ((.cse33 (+ (select (select .cse31 |c_~#A~0.base|) |c_~#A~0.offset|) 4)) (.cse32 (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse31 .cse32) .cse33)) (= (select (select (let ((.cse34 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse32 v_ArrVal_2179)) (.cse35 (select (select .cse36 .cse32) .cse33))) (store .cse34 .cse35 (store (select .cse34 .cse35) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))))) is different from false [2022-12-13 06:59:56,631 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|)) (.cse11 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base|)) (.cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse8 .cse12)))) (store .cse10 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse10 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse8 .cse9)))) (store .cse6 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse6 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|))))) (let ((.cse3 (select (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse4 (+ (select (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse3 v_ArrVal_2179)) (.cse1 (select (select .cse2 .cse3) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse5 .cse3) .cse4))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse18 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse20 .cse12)))) (store .cse21 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse21 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse15 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse20 .cse9)))) (store .cse19 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse19 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|))))) (let ((.cse16 (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse17 (+ (select (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse13 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse16 v_ArrVal_2179)) (.cse14 (select (select .cse15 .cse16) .cse17))) (store .cse13 .cse14 (store (select .cse13 .cse14) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse18 .cse16) .cse17))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse29 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse27 (let ((.cse30 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse29 .cse12)))) (store .cse30 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse30 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse24 (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse29 .cse9)))) (store .cse28 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse28 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|))))) (let ((.cse25 (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse26 (+ (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse22 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse25 v_ArrVal_2179)) (.cse23 (select (select .cse24 .cse25) .cse26))) (store .cse22 .cse23 (store (select .cse22 .cse23) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse27 .cse25) .cse26))))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2163 (Array Int Int))) (let ((.cse38 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse11 .cse38 .cse12)))) (store .cse39 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse39 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |ULTIMATE.start_insert_~p#1.offset|)))) (.cse33 (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_insert_#in~p#1.base| (store .cse7 .cse38 .cse9)))) (store .cse37 |c_ULTIMATE.start_insert_#in~list#1.base| (store (select .cse37 |c_ULTIMATE.start_insert_#in~list#1.base|) |c_ULTIMATE.start_insert_#in~list#1.offset| |c_ULTIMATE.start_insert_#in~p#1.base|))))) (let ((.cse34 (select (select .cse33 |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse35 (+ (select (select .cse36 |c_~#A~0.base|) |c_~#A~0.offset|) 4))) (or (= (select (select (let ((.cse31 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2147) |c_ULTIMATE.start_insert_#in~p#1.base| v_ArrVal_2155) |c_ULTIMATE.start_insert_#in~list#1.base| v_ArrVal_2163) |c_~#A~0.base| v_ArrVal_2167) .cse34 v_ArrVal_2179)) (.cse32 (select (select .cse33 .cse34) .cse35))) (store .cse31 .cse32 (store (select .cse31 .cse32) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select .cse36 .cse34) .cse35))))))))) is different from false [2022-12-13 06:59:56,842 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse4 .cse5)))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse4 .cse8)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse12 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse9 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse12 .cse5)))) (store .cse11 |c_~#A~0.base| (store (select .cse11 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse12 .cse8)))) (store .cse13 |c_~#A~0.base| (store (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse17 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse14 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse15 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse17 .cse5)))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse17))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse17 .cse8)))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse17))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse20 .cse8)))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse20)) (= (select (select (let ((.cse21 (store (store (store (store |c_#race| |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse20 .cse5)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse20))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) is different from false [2022-12-13 06:59:57,291 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_~#A~0.base|) |c_~#A~0.offset|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_~#A~0.base|) |c_~#A~0.offset|))) (and (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse4 .cse5)))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse4 .cse8)))) (store .cse6 |c_~#A~0.base| (store (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse12 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse9 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse10 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse12 .cse5)))) (store .cse11 |c_~#A~0.base| (store (select .cse11 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))) (store .cse9 .cse10 (store (select .cse9 .cse10) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse12 .cse8)))) (store .cse13 |c_~#A~0.base| (store (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse12))))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse15 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse15 .cse8)))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse15)) (= (select (select (let ((.cse16 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse17 (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse15 .cse5)))) (store .cse18 |c_~#A~0.base| (store (select .cse18 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse15))) (store .cse16 .cse17 (store (select .cse16 .cse17) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse20 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse7 .cse20 .cse8)))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse20)) (= (select (select (let ((.cse21 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse22 (select (select (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store .cse3 .cse20 .cse5)))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse20))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))))) is different from false [2022-12-13 06:59:57,743 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse4 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse3 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~p~1#1.base|) .cse4 (select (select .cse3 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse6 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~p~1#1.base|) .cse4 (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse5 |c_~#A~0.base| (store (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse4))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse11 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse7 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse8 (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse10 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse13 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse14 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse15 (select (select (let ((.cse16 (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse17 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 (select (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse16 |c_~#A~0.base| (store (select .cse16 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))) (store .cse14 .cse15 (store (select .cse14 .cse15) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse20 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~p~1#1.base|) .cse18 (select (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse25 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse21 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse22 (select (select (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2139))) (store .cse24 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse24 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 (select (select .cse24 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse23 |c_~#A~0.base| (store (select .cse23 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25))) (store .cse21 .cse22 (store (select .cse21 .cse22) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2138))) (store .cse27 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~p~1#1.base|) .cse25 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse26 |c_~#A~0.base| (store (select .cse26 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse25)))))) is different from false [2022-12-13 06:59:58,517 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse2 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse1 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~p~1#1.base|) .cse2 (select (select .cse1 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2)) (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse3 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse4 (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse6 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~p~1#1.base|) .cse2 (select (select .cse6 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse5 |c_~#A~0.base| (store (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse2))) (store .cse3 .cse4 (store (select .cse3 .cse4) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse11 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse7 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse8 (select (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse10 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse13 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~p~1#1.base|) .cse11 (select (select .cse13 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse11))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse16 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse14 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse15 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~p~1#1.base|) .cse16 (select (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse16)) (= (select (select (let ((.cse17 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse18 (select (select (let ((.cse19 (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse20 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~p~1#1.base|) .cse16 (select (select .cse20 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse16))) (store .cse17 .cse18 (store (select .cse17 .cse18) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse23 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2138))) (store .cse22 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse22 |c_ULTIMATE.start_main_~p~1#1.base|) .cse23 (select (select .cse22 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse21 |c_~#A~0.base| (store (select .cse21 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse23)) (= (select (select (let ((.cse24 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse25 (select (select (let ((.cse26 (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2139))) (store .cse27 |c_ULTIMATE.start_main_~p~1#1.base| (store (select .cse27 |c_ULTIMATE.start_main_~p~1#1.base|) .cse23 (select (select .cse27 |c_~#A~0.base|) |c_~#A~0.offset|)))))) (store .cse26 |c_~#A~0.base| (store (select .cse26 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse23))) (store .cse24 .cse25 (store (select .cse24 .cse25) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))))) is different from false [2022-12-13 06:59:58,726 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse3 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse0 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse2 |c_~#A~0.base| (store (select .cse2 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse3))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse3))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse8 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse5 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse7 |c_~#A~0.base| (store (select .cse7 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse8))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse8))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse13 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= (select (select (let ((.cse10 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse13 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse12 |c_~#A~0.base| (store (select .cse12 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse13))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse13 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse13))))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse18 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (= |c_t_funThread1of1ForFork0_#t~nondet40#1| (select (select (let ((.cse15 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2179)) (.cse16 (select (select (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2139 .cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse17 |c_~#A~0.base| (store (select .cse17 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18))) (store .cse15 .cse16 (store (select .cse15 .cse16) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| (store v_ArrVal_2138 .cse18 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base|) .cse18)))))) is different from false [2022-12-13 06:59:59,011 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse1 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse0 |c_~#A~0.base| (store (select .cse0 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse1)) (= (select (select (let ((.cse2 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse4 |c_~#A~0.base| (store (select .cse4 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse1))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse6 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse6 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse5 |c_~#A~0.base| (store (select .cse5 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse6)) (= (select (select (let ((.cse7 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse8 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse9 |c_~#A~0.base| (store (select .cse9 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse6))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse11 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse11 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse10 |c_~#A~0.base| (store (select .cse10 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse11)) (= (select (select (let ((.cse12 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse13 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse11 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse14 |c_~#A~0.base| (store (select .cse14 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse11))) (store .cse12 .cse13 (store (select .cse12 .cse13) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet40#1|)))) (forall ((v_ArrVal_2139 (Array Int Int)) (|v_ULTIMATE.start_main_~p~1#1.offset_29| Int) (v_ArrVal_2138 (Array Int Int)) (v_ArrVal_2147 (Array Int Int)) (|ULTIMATE.start_insert_~p#1.offset| Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2143 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse16 (+ |ULTIMATE.start_insert_~p#1.offset| 4))) (or (< |v_ULTIMATE.start_main_~p~1#1.offset_29| (select (select (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2138 .cse16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2138) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse15 |c_~#A~0.base| (store (select .cse15 |c_~#A~0.base|) |c_~#A~0.offset| |ULTIMATE.start_insert_~p#1.offset|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse16)) (= (select (select (let ((.cse17 (store (store (store (store (store |c_#race| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2143) |c_~#A~0.base| v_ArrVal_2147) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2155) |c_~#A~0.base| v_ArrVal_2167) |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2179)) (.cse18 (select (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| (store v_ArrVal_2139 .cse16 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc46#1.base| v_ArrVal_2139) |c_~#A~0.base|) |c_~#A~0.offset|))))) (store .cse19 |c_~#A~0.base| (store (select .cse19 |c_~#A~0.base|) |c_~#A~0.offset| |c_ULTIMATE.start_main_#t~malloc46#1.base|))) |c_ULTIMATE.start_main_#t~malloc46#1.base|) .cse16))) (store .cse17 .cse18 (store (select .cse17 .cse18) (+ |v_ULTIMATE.start_main_~p~1#1.offset_29| 4) v_ArrVal_2180))) |c_t_funThread1of1ForFork0_~p~0#1.base|) (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) |c_t_funThread1of1ForFork0_#t~nondet40#1|))))) is different from false [2022-12-13 07:01:44,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:01:44,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 174 [2022-12-13 07:01:44,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:01:44,319 INFO L350 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 122401783756 treesize of output 113838063604