./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am --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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- 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-4e7fbc6 [2022-11-23 06:46:43,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 06:46:43,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 06:46:43,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 06:46:43,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 06:46:43,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 06:46:43,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 06:46:43,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 06:46:43,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 06:46:43,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 06:46:43,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 06:46:43,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 06:46:43,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 06:46:43,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 06:46:43,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 06:46:43,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 06:46:43,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 06:46:43,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 06:46:43,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 06:46:43,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 06:46:43,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 06:46:43,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 06:46:43,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 06:46:43,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 06:46:43,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 06:46:43,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 06:46:43,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 06:46:43,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 06:46:43,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 06:46:43,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 06:46:43,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 06:46:43,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 06:46:43,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 06:46:43,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 06:46:43,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 06:46:43,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 06:46:43,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 06:46:43,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 06:46:43,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 06:46:43,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 06:46:43,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 06:46:43,360 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2022-11-23 06:46:43,384 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 06:46:43,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 06:46:43,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 06:46:43,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 06:46:43,386 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 06:46:43,386 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 06:46:43,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 06:46:43,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 06:46:43,387 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 06:46:43,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 06:46:43,388 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 06:46:43,388 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 06:46:43,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 06:46:43,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 06:46:43,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 06:46:43,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 06:46:43,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 06:46:43,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 06:46:43,390 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-23 06:46:43,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 06:46:43,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 06:46:43,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 06:46:43,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 06:46:43,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 06:46:43,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 06:46:43,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-23 06:46:43,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 06:46:43,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:46:43,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 06:46:43,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 06:46:43,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 06:46:43,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 06:46:43,393 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2022-11-23 06:46:43,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 06:46:43,394 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-23 06:46:43,394 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-23 06:46:43,394 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-23 06:46:43,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 06:46:43,394 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-23 06:46:43,395 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-23 06:46:43,395 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_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/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_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am 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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2022-11-23 06:46:43,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 06:46:43,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 06:46:43,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 06:46:43,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 06:46:43,694 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 06:46:43,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/../../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2022-11-23 06:46:46,780 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 06:46:47,046 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 06:46:47,047 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2022-11-23 06:46:47,062 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/data/a4985bcb0/16fc7feac8764f00bb52f3a52ba6bb1c/FLAGffb295245 [2022-11-23 06:46:47,077 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/data/a4985bcb0/16fc7feac8764f00bb52f3a52ba6bb1c [2022-11-23 06:46:47,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 06:46:47,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 06:46:47,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 06:46:47,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 06:46:47,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 06:46:47,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:47,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e51e392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47, skipping insertion in model container [2022-11-23 06:46:47,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:47,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 06:46:47,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 06:46:47,706 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i[47038,47051] [2022-11-23 06:46:47,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:46:47,811 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 06:46:47,868 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i[47038,47051] [2022-11-23 06:46:47,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 06:46:47,952 INFO L208 MainTranslator]: Completed translation [2022-11-23 06:46:47,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47 WrapperNode [2022-11-23 06:46:47,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 06:46:47,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 06:46:47,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 06:46:47,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 06:46:47,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:47,988 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,063 INFO L138 Inliner]: procedures = 278, calls = 54, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 310 [2022-11-23 06:46:48,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 06:46:48,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 06:46:48,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 06:46:48,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 06:46:48,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,131 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 06:46:48,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 06:46:48,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 06:46:48,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 06:46:48,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (1/1) ... [2022-11-23 06:46:48,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 06:46:48,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:48,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 06:46:48,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 06:46:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 06:46:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 06:46:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2022-11-23 06:46:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2022-11-23 06:46:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 06:46:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 06:46:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-11-23 06:46:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-11-23 06:46:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 06:46:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 06:46:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 06:46:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 06:46:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 06:46:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 06:46:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 06:46:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 06:46:48,226 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 06:46:48,454 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 06:46:48,456 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 06:46:49,117 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 06:46:49,131 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 06:46:49,131 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-23 06:46:49,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:46:49 BoogieIcfgContainer [2022-11-23 06:46:49,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 06:46:49,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 06:46:49,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 06:46:49,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 06:46:49,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:46:47" (1/3) ... [2022-11-23 06:46:49,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c68903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:46:49, skipping insertion in model container [2022-11-23 06:46:49,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:46:47" (2/3) ... [2022-11-23 06:46:49,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c68903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:46:49, skipping insertion in model container [2022-11-23 06:46:49,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:46:49" (3/3) ... [2022-11-23 06:46:49,148 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2022-11-23 06:46:49,157 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 06:46:49,167 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 06:46:49,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-11-23 06:46:49,168 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 06:46:49,365 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-23 06:46:49,440 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:46:49,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:46:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:49,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:46:49,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-23 06:46:49,492 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:46:49,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork0 ======== [2022-11-23 06:46:49,512 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;@1ef65c7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:46:49,512 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-23 06:46:50,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-23 06:46:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1492145195, now seen corresponding path program 1 times [2022-11-23 06:46:50,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:50,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266222758] [2022-11-23 06:46:50,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:50,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:50,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266222758] [2022-11-23 06:46:50,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266222758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:50,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:50,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:46:50,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318679158] [2022-11-23 06:46:50,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:50,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 06:46:50,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 06:46:50,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 06:46:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:50,484 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:50,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 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-11-23 06:46:50,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:50,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 06:46:50,534 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-23 06:46:50,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:50,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1198742188, now seen corresponding path program 1 times [2022-11-23 06:46:50,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:50,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891864772] [2022-11-23 06:46:50,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891864772] [2022-11-23 06:46:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891864772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:50,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:46:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683581651] [2022-11-23 06:46:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:50,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:46:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:50,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:46:50,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:46:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:50,805 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:50,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-11-23 06:46:50,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:50,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:51,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 06:46:51,042 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-23 06:46:51,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash -61607436, now seen corresponding path program 1 times [2022-11-23 06:46:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:51,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197836059] [2022-11-23 06:46:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:51,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:51,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:51,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197836059] [2022-11-23 06:46:51,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197836059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:46:51,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194918499] [2022-11-23 06:46:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:51,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:51,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:51,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:46:51,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 06:46:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:51,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 06:46:51,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:46:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:46:51,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:46:51,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194918499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:51,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:46:51,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-23 06:46:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886447918] [2022-11-23 06:46:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:51,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:46:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:46:51,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:51,661 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:51,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 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-11-23 06:46:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:51,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:51,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:51,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 06:46:51,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:51,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-23 06:46:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash 352819071, now seen corresponding path program 1 times [2022-11-23 06:46:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:51,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073673431] [2022-11-23 06:46:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:46:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073673431] [2022-11-23 06:46:52,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073673431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:46:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498451999] [2022-11-23 06:46:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:52,254 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:46:52,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 06:46:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:52,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 06:46:52,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:46:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:46:52,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:46:52,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498451999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:52,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:46:52,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 06:46:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477673824] [2022-11-23 06:46:52,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:52,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:46:52,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:52,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:46:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:52,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:52,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-11-23 06:46:52,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:52,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:52,535 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:52,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:52,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:52,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 06:46:52,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:52,910 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr7ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2022-11-23 06:46:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:52,911 INFO L85 PathProgramCache]: Analyzing trace with hash -182049171, now seen corresponding path program 1 times [2022-11-23 06:46:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:52,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682048811] [2022-11-23 06:46:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:52,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:46:53,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:53,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682048811] [2022-11-23 06:46:53,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682048811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:46:53,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240523160] [2022-11-23 06:46:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:53,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:53,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:53,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:46:53,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 06:46:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:53,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 06:46:53,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:46:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:46:53,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:46:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:46:53,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240523160] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:46:53,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:46:53,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-23 06:46:53,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632583170] [2022-11-23 06:46:53,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:46:53,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 06:46:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 06:46:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 06:46:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:53,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:53,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 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-11-23 06:46:53,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:53,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:53,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:53,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:53,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:53,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:53,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining) [2022-11-23 06:46:53,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-11-23 06:46:53,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr7ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-11-23 06:46:53,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-11-23 06:46:53,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-11-23 06:46:53,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-11-23 06:46:53,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-11-23 06:46:53,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr6ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2022-11-23 06:46:53,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 06:46:53,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:53,972 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-23 06:46:53,973 INFO L307 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/3) [2022-11-23 06:46:53,978 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:46:53,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:46:53,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:53,990 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:46:53,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-11-23 06:46:53,995 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:46:53,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork1 ======== [2022-11-23 06:46:53,996 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;@1ef65c7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:46:53,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 06:46:54,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2094600149, now seen corresponding path program 1 times [2022-11-23 06:46:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:54,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958437783] [2022-11-23 06:46:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:46:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:54,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958437783] [2022-11-23 06:46:54,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958437783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:54,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:54,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:46:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225462651] [2022-11-23 06:46:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:54,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 06:46:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:54,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 06:46:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 06:46:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:54,328 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:54,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 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-11-23 06:46:54,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:54,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 06:46:54,352 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1325516655, now seen corresponding path program 1 times [2022-11-23 06:46:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:54,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417320253] [2022-11-23 06:46:54,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:54,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:54,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417320253] [2022-11-23 06:46:54,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417320253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:46:54,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633318475] [2022-11-23 06:46:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:54,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:54,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:54,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:46:54,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 06:46:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:54,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 06:46:54,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:46:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:46:54,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:46:54,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633318475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:54,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:46:54,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 06:46:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144724047] [2022-11-23 06:46:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:54,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:46:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:46:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:54,701 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:54,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-23 06:46:54,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:54,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:54,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 06:46:54,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 06:46:54,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash -790053478, now seen corresponding path program 1 times [2022-11-23 06:46:54,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:54,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841745934] [2022-11-23 06:46:54,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:54,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:55,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841745934] [2022-11-23 06:46:55,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841745934] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:46:55,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315714065] [2022-11-23 06:46:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:46:55,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:55,149 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:46:55,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 06:46:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:55,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 06:46:55,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:46:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:55,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:46:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:55,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315714065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:46:55,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:46:55,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-23 06:46:55,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356231104] [2022-11-23 06:46:55,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:46:55,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 06:46:55,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:55,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 06:46:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 06:46:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:55,443 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:55,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 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-11-23 06:46:55,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:55,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:55,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:55,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 06:46:55,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-23 06:46:55,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash 956660391, now seen corresponding path program 1 times [2022-11-23 06:46:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:55,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754516157] [2022-11-23 06:46:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:46:56,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:56,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754516157] [2022-11-23 06:46:56,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754516157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:56,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:56,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:46:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820078669] [2022-11-23 06:46:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:56,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:46:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:46:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:56,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:56,340 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-11-23 06:46:56,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:56,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:56,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:56,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:56,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 06:46:56,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:56,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1213236052, now seen corresponding path program 1 times [2022-11-23 06:46:56,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:56,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951691196] [2022-11-23 06:46:56,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:56,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:46:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951691196] [2022-11-23 06:46:57,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951691196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:57,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:57,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:46:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283856193] [2022-11-23 06:46:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:57,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:46:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:46:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:57,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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-11-23 06:46:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 06:46:57,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr2ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 651257199, now seen corresponding path program 1 times [2022-11-23 06:46:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:57,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196170783] [2022-11-23 06:46:57,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:46:57,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:57,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196170783] [2022-11-23 06:46:57,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196170783] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:57,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:57,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:46:57,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123025577] [2022-11-23 06:46:57,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:57,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:46:57,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:57,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:46:57,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:46:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,197 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:57,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 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-11-23 06:46:57,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 06:46:57,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:57,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1275423864, now seen corresponding path program 1 times [2022-11-23 06:46:57,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:57,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172171377] [2022-11-23 06:46:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:46:57,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:57,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172171377] [2022-11-23 06:46:57,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172171377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:57,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:57,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:46:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914119861] [2022-11-23 06:46:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:57,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:46:57,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:57,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:46:57,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,790 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:57,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 states have internal predecessors, (119), 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-11-23 06:46:57,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,790 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:57,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 06:46:57,943 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1824350939, now seen corresponding path program 1 times [2022-11-23 06:46:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218363935] [2022-11-23 06:46:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:46:58,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:58,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218363935] [2022-11-23 06:46:58,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218363935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:58,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:58,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:46:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521869446] [2022-11-23 06:46:58,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:58,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:46:58,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:58,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:46:58,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:58,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:58,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.6) internal successors, (128), 6 states have internal predecessors, (128), 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-11-23 06:46:58,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:58,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:58,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:58,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 06:46:58,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:46:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash -276765728, now seen corresponding path program 1 times [2022-11-23 06:46:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:58,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653853533] [2022-11-23 06:46:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:46:59,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:59,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653853533] [2022-11-23 06:46:59,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653853533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:59,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:59,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:46:59,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784749913] [2022-11-23 06:46:59,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:59,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:46:59,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:59,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:46:59,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:46:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,340 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:59,340 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-11-23 06:46:59,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:46:59,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2022-11-23 06:46:59,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2022-11-23 06:46:59,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2022-11-23 06:46:59,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2022-11-23 06:46:59,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2022-11-23 06:46:59,777 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2022-11-23 06:46:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 06:46:59,784 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 06:46:59,785 INFO L307 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork1 was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (2/3) [2022-11-23 06:46:59,788 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:46:59,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:46:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:46:59,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:46:59,795 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:46:59,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-23 06:46:59,795 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;@1ef65c7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:46:59,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-23 06:46:59,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-11-23 06:46:59,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:46:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1487042024, now seen corresponding path program 1 times [2022-11-23 06:46:59,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:59,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960208326] [2022-11-23 06:46:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:59,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960208326] [2022-11-23 06:46:59,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960208326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:59,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:59,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:46:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539582532] [2022-11-23 06:46:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:59,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:46:59,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:46:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:46:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:59,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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-11-23 06:46:59,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 06:46:59,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:46:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1272635081, now seen corresponding path program 1 times [2022-11-23 06:46:59,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415166971] [2022-11-23 06:46:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:46:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:46:59,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:46:59,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415166971] [2022-11-23 06:46:59,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415166971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:46:59,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:46:59,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:46:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069226475] [2022-11-23 06:46:59,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:46:59,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:46:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:46:59,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:46:59,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:46:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,886 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:46:59,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-11-23 06:46:59,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:46:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:46:59,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 06:46:59,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:46:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:46:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1382513203, now seen corresponding path program 1 times [2022-11-23 06:46:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:46:59,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308780328] [2022-11-23 06:46:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:46:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:46:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:00,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:00,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308780328] [2022-11-23 06:47:00,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308780328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:00,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:00,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315414896] [2022-11-23 06:47:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:00,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:00,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:00,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:00,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:00,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:00,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:47:00,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 06:47:00,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:00,158 INFO L85 PathProgramCache]: Analyzing trace with hash -952656655, now seen corresponding path program 1 times [2022-11-23 06:47:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514767547] [2022-11-23 06:47:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:00,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:00,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514767547] [2022-11-23 06:47:00,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514767547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:00,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:00,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846056136] [2022-11-23 06:47:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:00,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:00,388 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:00,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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-11-23 06:47:00,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 06:47:00,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:00,472 INFO L85 PathProgramCache]: Analyzing trace with hash -157530974, now seen corresponding path program 1 times [2022-11-23 06:47:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:00,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711336139] [2022-11-23 06:47:00,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:00,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:00,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:00,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711336139] [2022-11-23 06:47:00,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711336139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:00,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:00,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:47:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432102759] [2022-11-23 06:47:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:00,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:00,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:47:00,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:00,532 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:00,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-11-23 06:47:00,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:00,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 06:47:00,987 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1403010326, now seen corresponding path program 1 times [2022-11-23 06:47:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:00,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733220061] [2022-11-23 06:47:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733220061] [2022-11-23 06:47:01,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733220061] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:01,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776060832] [2022-11-23 06:47:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:01,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:01,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:01,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:01,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 06:47:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:01,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 06:47:01,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:01,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:47:01,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776060832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:01,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:47:01,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 06:47:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940109702] [2022-11-23 06:47:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:01,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:01,412 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:01,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-23 06:47:01,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:01,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:01,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:01,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:01,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:01,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:01,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:01,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-23 06:47:01,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 623045229, now seen corresponding path program 1 times [2022-11-23 06:47:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512698466] [2022-11-23 06:47:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512698466] [2022-11-23 06:47:02,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512698466] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:02,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51104034] [2022-11-23 06:47:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:02,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:02,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:02,087 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:02,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 06:47:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:02,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 06:47:02,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:47:02,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:47:02,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51104034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:02,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:47:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 06:47:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688336873] [2022-11-23 06:47:02,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:02,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:02,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:02,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-11-23 06:47:02,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:02,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:02,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:02,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:02,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:02,741 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 619924693, now seen corresponding path program 1 times [2022-11-23 06:47:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:02,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851504586] [2022-11-23 06:47:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:02,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851504586] [2022-11-23 06:47:02,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851504586] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:02,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205223631] [2022-11-23 06:47:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:02,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:02,871 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:02,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 06:47:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:03,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 06:47:03,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:03,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:03,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205223631] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:03,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:03,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-23 06:47:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536925491] [2022-11-23 06:47:03,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:03,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 06:47:03,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:03,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 06:47:03,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 06:47:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:03,239 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:03,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 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-11-23 06:47:03,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:03,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:03,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,241 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:03,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:03,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:03,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1694657881, now seen corresponding path program 1 times [2022-11-23 06:47:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:03,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959233899] [2022-11-23 06:47:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:03,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 06:47:03,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 06:47:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 06:47:03,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 06:47:03,594 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 06:47:03,594 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-23 06:47:03,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-11-23 06:47:03,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-11-23 06:47:03,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-11-23 06:47:03,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-11-23 06:47:03,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-11-23 06:47:03,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-11-23 06:47:03,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-11-23 06:47:03,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-23 06:47:03,601 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 06:47:03,602 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (3/3) [2022-11-23 06:47:03,602 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-23 06:47:03,602 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-23 06:47:03,715 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2022-11-23 06:47:03,720 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:47:03,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:47:03,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:03,721 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:47:03,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2022-11-23 06:47:03,731 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:47:03,732 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-23 06:47:03,733 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;@1ef65c7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:47:03,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-23 06:47:03,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -874484902, now seen corresponding path program 1 times [2022-11-23 06:47:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:03,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056302208] [2022-11-23 06:47:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:03,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:03,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056302208] [2022-11-23 06:47:03,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056302208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:03,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:03,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:47:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557139087] [2022-11-23 06:47:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:03,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:03,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:03,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:47:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:03,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:03,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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-11-23 06:47:03,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 06:47:03,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash -929575029, now seen corresponding path program 1 times [2022-11-23 06:47:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:03,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617064938] [2022-11-23 06:47:03,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:03,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:03,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617064938] [2022-11-23 06:47:03,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617064938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:03,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:03,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:47:03,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368114775] [2022-11-23 06:47:03,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:03,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:03,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:03,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:03,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:47:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:03,825 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:03,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-11-23 06:47:03,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,825 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:03,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 06:47:03,834 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -357774131, now seen corresponding path program 1 times [2022-11-23 06:47:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:03,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532148541] [2022-11-23 06:47:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:04,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532148541] [2022-11-23 06:47:04,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532148541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:04,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:04,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:04,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980781890] [2022-11-23 06:47:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:04,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:04,072 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:04,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 06:47:04,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:04,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-23 06:47:04,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:04,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:04,104 INFO L85 PathProgramCache]: Analyzing trace with hash -876501775, now seen corresponding path program 1 times [2022-11-23 06:47:04,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:04,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229296863] [2022-11-23 06:47:04,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:04,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229296863] [2022-11-23 06:47:04,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229296863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:04,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:04,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017127060] [2022-11-23 06:47:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:04,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:04,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:04,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:04,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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-11-23 06:47:04,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:04,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:04,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:04,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-23 06:47:04,422 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1285887714, now seen corresponding path program 1 times [2022-11-23 06:47:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:04,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335311164] [2022-11-23 06:47:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:04,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:04,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335311164] [2022-11-23 06:47:04,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335311164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:04,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:04,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:47:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169783910] [2022-11-23 06:47:04,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:04,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:47:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:04,479 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:04,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-11-23 06:47:04,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:04,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:04,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:04,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-23 06:47:05,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 17129263, now seen corresponding path program 1 times [2022-11-23 06:47:05,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:05,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987226066] [2022-11-23 06:47:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:05,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987226066] [2022-11-23 06:47:05,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987226066] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:05,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41521556] [2022-11-23 06:47:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:05,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:05,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:05,185 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:05,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 06:47:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:05,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 06:47:05,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:05,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:47:05,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41521556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:05,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:47:05,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 06:47:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823420356] [2022-11-23 06:47:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:05,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:05,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:05,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:05,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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-11-23 06:47:05,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:05,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:05,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:05,929 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:06,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-23 06:47:06,127 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1677802729, now seen corresponding path program 1 times [2022-11-23 06:47:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:06,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21326007] [2022-11-23 06:47:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:06,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21326007] [2022-11-23 06:47:06,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21326007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899266241] [2022-11-23 06:47:06,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:06,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:06,251 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:06,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 06:47:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:06,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 06:47:06,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 06:47:06,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:47:06,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899266241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:06,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:47:06,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 06:47:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957737377] [2022-11-23 06:47:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:06,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:06,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:06,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:06,617 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:06,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-11-23 06:47:06,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:06,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:06,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:06,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:07,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:07,081 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:07,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash -911800993, now seen corresponding path program 1 times [2022-11-23 06:47:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:07,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590349301] [2022-11-23 06:47:07,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:07,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:07,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590349301] [2022-11-23 06:47:07,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590349301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:07,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242235638] [2022-11-23 06:47:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:07,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:07,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:07,266 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:07,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 06:47:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:07,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 06:47:07,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:07,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:07,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242235638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:07,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:07,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-23 06:47:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811550188] [2022-11-23 06:47:07,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:07,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 06:47:07,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 06:47:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 06:47:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:07,673 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:07,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 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-11-23 06:47:07,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:07,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:07,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,674 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:07,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:08,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-23 06:47:08,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1686807521, now seen corresponding path program 1 times [2022-11-23 06:47:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:08,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877129726] [2022-11-23 06:47:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:47:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:08,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877129726] [2022-11-23 06:47:08,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877129726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:08,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:08,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 06:47:08,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607139281] [2022-11-23 06:47:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:08,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:08,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:08,587 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:08,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-11-23 06:47:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:08,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:08,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:08,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-23 06:47:08,783 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2022-11-23 06:47:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash -488097051, now seen corresponding path program 1 times [2022-11-23 06:47:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:08,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934539677] [2022-11-23 06:47:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 06:47:08,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 06:47:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 06:47:08,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 06:47:08,876 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 06:47:08,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-23 06:47:08,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2022-11-23 06:47:08,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2022-11-23 06:47:08,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2022-11-23 06:47:08,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2022-11-23 06:47:08,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2022-11-23 06:47:08,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2022-11-23 06:47:08,878 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-11-23 06:47:08,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-23 06:47:08,884 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 06:47:08,884 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/5) [2022-11-23 06:47:08,884 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-23 06:47:08,884 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-23 06:47:08,984 INFO L144 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2022-11-23 06:47:08,989 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:47:08,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-23 06:47:08,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:08,991 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-23 06:47:08,996 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-23 06:47:08,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of3ForFork1 ======== [2022-11-23 06:47:08,997 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;@1ef65c7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 06:47:08,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 06:47:09,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2022-11-23 06:47:09,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash -237646609, now seen corresponding path program 1 times [2022-11-23 06:47:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:09,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521613635] [2022-11-23 06:47:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:09,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:09,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521613635] [2022-11-23 06:47:09,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521613635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:09,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:09,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:47:09,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618176056] [2022-11-23 06:47:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:09,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 06:47:09,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:09,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 06:47:09,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 06:47:09,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:09,469 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:09,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 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-11-23 06:47:09,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:09,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-23 06:47:09,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:09,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:09,533 INFO L85 PathProgramCache]: Analyzing trace with hash 637203883, now seen corresponding path program 1 times [2022-11-23 06:47:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:09,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72048980] [2022-11-23 06:47:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:09,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72048980] [2022-11-23 06:47:09,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72048980] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:09,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9688896] [2022-11-23 06:47:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:09,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:09,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:09,627 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:09,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 06:47:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:09,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 06:47:09,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:09,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 06:47:09,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9688896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:09,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 06:47:09,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 06:47:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83126102] [2022-11-23 06:47:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:09,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:09,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:09,979 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:09,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-11-23 06:47:09,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:09,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:10,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:10,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:10,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 299685387, now seen corresponding path program 1 times [2022-11-23 06:47:10,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666375968] [2022-11-23 06:47:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:10,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:10,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666375968] [2022-11-23 06:47:10,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666375968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:10,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213207748] [2022-11-23 06:47:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:10,440 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:10,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 06:47:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:10,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 06:47:10,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:10,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:10,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213207748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:10,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:10,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-23 06:47:10,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030361505] [2022-11-23 06:47:10,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:10,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 06:47:10,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:10,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 06:47:10,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 06:47:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:10,979 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 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-11-23 06:47:10,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:10,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:10,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:11,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:11,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:11,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-23 06:47:11,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr0ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1420432751, now seen corresponding path program 1 times [2022-11-23 06:47:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:11,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510638509] [2022-11-23 06:47:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 06:47:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:11,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510638509] [2022-11-23 06:47:11,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510638509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:11,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:11,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:11,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116356927] [2022-11-23 06:47:11,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:11,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:11,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:11,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:11,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:11,722 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:11,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.4) internal successors, (102), 6 states have internal predecessors, (102), 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-11-23 06:47:11,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:11,722 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:11,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:11,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:12,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-23 06:47:12,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr1ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1181695151, now seen corresponding path program 1 times [2022-11-23 06:47:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:12,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073140543] [2022-11-23 06:47:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:13,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073140543] [2022-11-23 06:47:13,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073140543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:13,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97585288] [2022-11-23 06:47:13,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:13,170 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:13,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 06:47:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:13,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-23 06:47:13,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:13,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:47:13,656 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:47:13,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:47:13,691 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 13 treesize of output 9 [2022-11-23 06:47:13,709 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 23 treesize of output 22 [2022-11-23 06:47:13,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:13,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:47:13,765 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 34 treesize of output 32 [2022-11-23 06:47:13,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:13,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:47:13,829 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 43 treesize of output 39 [2022-11-23 06:47:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:13,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:13,906 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3133 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ 7 |c_t1_funThread1of3ForFork1_init_~p#1.offset|)) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)) (forall ((v_ArrVal_3133 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ 5 |c_t1_funThread1of3ForFork1_init_~p#1.offset|)) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)) (forall ((v_ArrVal_3133 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_init_#t~nondet4#1| (select (select (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread1of3ForFork1_init_~p#1.offset| 4)))) (forall ((v_ArrVal_3133 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread1of3ForFork1_init_~p#1.offset| 6)) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|))) is different from false [2022-11-23 06:47:13,929 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of3ForFork1_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_init_~p#1.base| (store (select |c_#race| |c_t1_funThread1of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_3133 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread1of3ForFork1_init_~p#1.offset| 4)) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)) (forall ((v_ArrVal_3133 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ 5 |c_t1_funThread1of3ForFork1_init_~p#1.offset|)) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)) (forall ((v_ArrVal_3133 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_init_#t~nondet4#1| (select (select (store .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread1of3ForFork1_init_~p#1.offset| 6)))) (forall ((v_ArrVal_3133 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) .cse1) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|))))) is different from false [2022-11-23 06:47:13,983 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of3ForFork1_init_~p#1.offset|))) (and (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3130))) (store .cse0 |c_t1_funThread1of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread1of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread1of3ForFork1_init_~p#1.offset| 4)) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)) (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3130))) (store .cse2 |c_t1_funThread1of3ForFork1_init_~p#1.base| (store (select .cse2 |c_t1_funThread1of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread1of3ForFork1_init_~p#1.offset| 6)) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)) (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse3 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3130))) (store .cse3 |c_t1_funThread1of3ForFork1_init_~p#1.base| (store (select .cse3 |c_t1_funThread1of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) (+ 5 |c_t1_funThread1of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3130))) (store .cse4 |c_t1_funThread1of3ForFork1_init_~p#1.base| (store (select .cse4 |c_t1_funThread1of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread2of3ForFork1_init_~p#1.base| v_ArrVal_3133) |c_t1_funThread1of3ForFork1_init_~p#1.base|) .cse1) |c_t1_funThread1of3ForFork1_init_#t~nondet4#1|)))) is different from false [2022-11-23 06:47:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 06:47:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97585288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:14,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:14,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 21 [2022-11-23 06:47:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747429302] [2022-11-23 06:47:14,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 06:47:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 06:47:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=295, Unknown=3, NotChecked=108, Total=462 [2022-11-23 06:47:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:14,242 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:14,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.666666666666667) internal successors, (161), 22 states have internal predecessors, (161), 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-11-23 06:47:14,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:14,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:14,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:14,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:14,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:15,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:15,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:15,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:15,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr2ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:15,738 INFO L85 PathProgramCache]: Analyzing trace with hash 707384921, now seen corresponding path program 1 times [2022-11-23 06:47:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:15,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994177592] [2022-11-23 06:47:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-23 06:47:15,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994177592] [2022-11-23 06:47:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994177592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:15,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 06:47:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802056084] [2022-11-23 06:47:15,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:15,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:47:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:15,823 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:15,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 64.5) internal successors, (129), 3 states have internal predecessors, (129), 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-11-23 06:47:15,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:15,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:15,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:15,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:15,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:15,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:16,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-23 06:47:16,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:16,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1940600995, now seen corresponding path program 1 times [2022-11-23 06:47:16,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:16,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091663169] [2022-11-23 06:47:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-23 06:47:16,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091663169] [2022-11-23 06:47:16,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091663169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:16,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960811954] [2022-11-23 06:47:16,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:16,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:16,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:16,446 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:16,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 06:47:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:16,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 06:47:16,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:17,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 06:47:17,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960811954] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:17,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:17,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-11-23 06:47:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184384191] [2022-11-23 06:47:17,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 06:47:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 06:47:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-11-23 06:47:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:17,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:17,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.42105263157895) internal successors, (369), 19 states have internal predecessors, (369), 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-11-23 06:47:17,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:17,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:17,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:17,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:17,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:17,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:17,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:17,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:17,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:17,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-23 06:47:17,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash -120691700, now seen corresponding path program 1 times [2022-11-23 06:47:17,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:17,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566830993] [2022-11-23 06:47:17,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:17,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-23 06:47:18,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:18,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566830993] [2022-11-23 06:47:18,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566830993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:18,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:18,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 06:47:18,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612762121] [2022-11-23 06:47:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:18,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:18,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:18,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:18,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 6 states have internal predecessors, (151), 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-11-23 06:47:18,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:18,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:18,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:18,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:18,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:18,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:18,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:18,316 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:18,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:18,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-23 06:47:18,687 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:18,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1002934875, now seen corresponding path program 1 times [2022-11-23 06:47:18,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:18,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263729790] [2022-11-23 06:47:18,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:18,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:19,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:19,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263729790] [2022-11-23 06:47:19,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263729790] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:19,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786511058] [2022-11-23 06:47:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:19,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:19,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:19,594 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:19,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 06:47:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:20,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 06:47:20,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:20,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:47:20,089 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:47:20,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:47:20,130 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-11-23 06:47:20,147 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-11-23 06:47:20,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 06:47:20,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:20,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 06:47:20,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:20,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 06:47:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:20,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:20,316 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3895 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread1of3ForFork1_init_~p#1.base| v_ArrVal_3895) |c_t1_funThread2of3ForFork1_init_~p#1.base|) |c_t1_funThread2of3ForFork1_init_~p#1.offset|) |c_t1_funThread2of3ForFork1_init_#t~nondet3#1|)) is different from false [2022-11-23 06:47:20,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:20,331 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-23 06:47:20,334 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 18 treesize of output 14 [2022-11-23 06:47:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 06:47:20,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786511058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:20,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:20,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 20 [2022-11-23 06:47:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758484220] [2022-11-23 06:47:20,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 06:47:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 06:47:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=296, Unknown=1, NotChecked=34, Total=380 [2022-11-23 06:47:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:20,464 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:20,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.2) internal successors, (204), 20 states have internal predecessors, (204), 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-11-23 06:47:20,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:20,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:20,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:20,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:20,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:20,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:20,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:20,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:20,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:21,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:21,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:21,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:21,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-23 06:47:21,730 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:21,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1313037865, now seen corresponding path program 1 times [2022-11-23 06:47:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:21,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262695343] [2022-11-23 06:47:21,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:21,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-23 06:47:22,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:22,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262695343] [2022-11-23 06:47:22,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262695343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:22,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:22,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253248910] [2022-11-23 06:47:22,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:22,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:22,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:22,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:22,281 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:22,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 31.8) internal successors, (159), 6 states have internal predecessors, (159), 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-11-23 06:47:22,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:22,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:22,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:22,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-23 06:47:22,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1589340607, now seen corresponding path program 1 times [2022-11-23 06:47:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:22,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99607668] [2022-11-23 06:47:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:22,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-23 06:47:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:23,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99607668] [2022-11-23 06:47:23,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99607668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:23,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:23,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751105675] [2022-11-23 06:47:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:23,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:23,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:23,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:23,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.6) internal successors, (168), 6 states have internal predecessors, (168), 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-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:23,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:23,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:23,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:23,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:23,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-23 06:47:23,813 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1375128378, now seen corresponding path program 1 times [2022-11-23 06:47:23,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:23,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387582643] [2022-11-23 06:47:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:23,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-23 06:47:24,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:24,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387582643] [2022-11-23 06:47:24,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387582643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:24,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:24,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 06:47:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183348175] [2022-11-23 06:47:24,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:24,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 06:47:24,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:24,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 06:47:24,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 06:47:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:24,484 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:24,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.2) internal successors, (176), 6 states have internal predecessors, (176), 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-11-23 06:47:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:24,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:24,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:24,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:24,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-23 06:47:24,946 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 70848834, now seen corresponding path program 1 times [2022-11-23 06:47:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:24,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612378401] [2022-11-23 06:47:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:47:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:25,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612378401] [2022-11-23 06:47:25,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612378401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:25,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298133461] [2022-11-23 06:47:25,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:25,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:25,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:25,818 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:25,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 06:47:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:26,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-23 06:47:26,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:26,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:47:26,447 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:47:26,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:47:26,496 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 13 treesize of output 9 [2022-11-23 06:47:26,518 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 23 treesize of output 22 [2022-11-23 06:47:26,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:26,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:47:26,563 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 34 treesize of output 32 [2022-11-23 06:47:26,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:26,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:47:26,607 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 43 treesize of output 39 [2022-11-23 06:47:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:47:26,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:26,681 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4680 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) is different from false [2022-11-23 06:47:26,699 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_4680 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_4680 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))))))) is different from false [2022-11-23 06:47:26,729 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (and (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse0 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse2 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse2 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse2 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse3 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse3 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse4 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse4 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse4 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))))) is different from false [2022-11-23 06:47:26,839 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (let ((.cse1 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse2 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse6 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse0 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse3 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse3 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse4 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse4 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse4 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse5 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse5 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse5 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse6)))))) is different from false [2022-11-23 06:47:26,914 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse4 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (let ((.cse1 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse2 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse6 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|) .cse4 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse0 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse3 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse3 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse3 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse4))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse5 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse5 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse5 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse6))) (forall ((v_ArrVal_4680 (Array Int Int)) (v_ArrVal_4677 (Array Int Int))) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select (select (store (let ((.cse7 (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4677))) (store .cse7 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select .cse7 |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|))) |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_4680) |c_t1_funThread2of3ForFork1_init_~p#1.base|) (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))))))) is different from false [2022-11-23 06:47:26,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:26,977 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 3 case distinctions, treesize of input 68 treesize of output 59 [2022-11-23 06:47:26,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:26,986 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 62 [2022-11-23 06:47:26,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 06:47:27,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-11-23 06:47:27,020 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-23 06:47:27,021 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 1 [2022-11-23 06:47:27,026 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-23 06:47:27,027 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 1 [2022-11-23 06:47:27,033 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2022-11-23 06:47:27,033 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 1 [2022-11-23 06:47:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-11-23 06:47:27,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298133461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:27,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:27,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 24 [2022-11-23 06:47:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301412509] [2022-11-23 06:47:27,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:27,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 06:47:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 06:47:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=297, Unknown=5, NotChecked=190, Total=552 [2022-11-23 06:47:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:27,168 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:27,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.541666666666666) internal successors, (229), 24 states have internal predecessors, (229), 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-11-23 06:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:27,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:27,170 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:27,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:27,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:28,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:28,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-23 06:47:28,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash -936755025, now seen corresponding path program 1 times [2022-11-23 06:47:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:28,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84987251] [2022-11-23 06:47:28,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-23 06:47:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:29,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84987251] [2022-11-23 06:47:29,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84987251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 06:47:29,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 06:47:29,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 06:47:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039323802] [2022-11-23 06:47:29,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 06:47:29,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 06:47:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 06:47:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 06:47:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:29,201 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:29,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-11-23 06:47:29,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:29,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:29,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:29,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:29,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:29,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-23 06:47:29,499 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1708758005, now seen corresponding path program 1 times [2022-11-23 06:47:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:29,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294481995] [2022-11-23 06:47:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:47:30,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:30,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294481995] [2022-11-23 06:47:30,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294481995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:30,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686533114] [2022-11-23 06:47:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:30,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:30,782 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:30,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 06:47:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:31,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-23 06:47:31,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:31,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:47:31,416 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:47:31,416 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-11-23 06:47:31,451 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:47:31,452 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-11-23 06:47:31,506 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:47:31,507 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-11-23 06:47:31,576 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:47:31,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:47:31,678 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 13 treesize of output 9 [2022-11-23 06:47:31,702 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 23 treesize of output 22 [2022-11-23 06:47:31,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:31,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:47:31,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:31,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:47:31,791 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 43 treesize of output 39 [2022-11-23 06:47:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:47:31,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:31,825 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5157 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)))) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7)) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0))) is different from false [2022-11-23 06:47:31,855 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0))))) is different from false [2022-11-23 06:47:31,895 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_5157 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5157) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse2) 0))))) is different from false [2022-11-23 06:47:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:47:32,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686533114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:32,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:32,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2022-11-23 06:47:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239264807] [2022-11-23 06:47:32,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:32,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 06:47:32,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:32,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 06:47:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=231, Unknown=3, NotChecked=96, Total=380 [2022-11-23 06:47:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:32,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:32,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.0) internal successors, (266), 20 states have internal predecessors, (266), 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-11-23 06:47:32,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:32,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:32,367 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:32,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:32,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:32,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:32,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:32,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:47:34,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:34,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-23 06:47:34,504 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1_funErr4ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2138088871, now seen corresponding path program 1 times [2022-11-23 06:47:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:34,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222818179] [2022-11-23 06:47:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:47:36,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:36,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222818179] [2022-11-23 06:47:36,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222818179] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715805062] [2022-11-23 06:47:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:36,610 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:36,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-23 06:47:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:37,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 06:47:37,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:37,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:47:37,342 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:47:37,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 06:47:37,417 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:47:37,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-23 06:47:37,806 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-23 06:47:37,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 45 [2022-11-23 06:47:38,123 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-23 06:47:38,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-11-23 06:47:38,391 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 13 treesize of output 9 [2022-11-23 06:47:38,440 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 16 treesize of output 18 [2022-11-23 06:47:38,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 06:47:38,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:38,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:47:38,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:38,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:47:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 06:47:38,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:38,516 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5504 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5504) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) |c_t1_funThread1of3ForFork1_insert_#t~nondet12#1|)) is different from false [2022-11-23 06:47:38,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:38,522 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-23 06:47:38,525 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 22 treesize of output 16 [2022-11-23 06:47:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:47:39,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715805062] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:39,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:39,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 15] total 37 [2022-11-23 06:47:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106549000] [2022-11-23 06:47:39,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:39,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 06:47:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 06:47:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2022-11-23 06:47:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:39,390 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:39,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 11.864864864864865) internal successors, (439), 38 states have internal predecessors, (439), 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-11-23 06:47:39,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:39,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:39,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:39,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:39,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:39,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:39,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:39,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:47:39,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:44,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:47:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:47:44,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:44,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-23 06:47:44,601 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:44,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash -164440930, now seen corresponding path program 1 times [2022-11-23 06:47:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:44,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469841048] [2022-11-23 06:47:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469841048] [2022-11-23 06:47:46,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469841048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459231328] [2022-11-23 06:47:46,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:46,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:46,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:46,958 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:46,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-23 06:47:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:47,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 06:47:47,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:47,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:47:47,766 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:47:47,767 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-11-23 06:47:47,944 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:47:47,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:47:48,203 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 13 treesize of output 9 [2022-11-23 06:47:48,239 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 16 treesize of output 18 [2022-11-23 06:47:48,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 06:47:48,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:48,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:47:48,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:48,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:47:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 06:47:48,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:48,475 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5883 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_5883) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 4)) |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)) is different from false [2022-11-23 06:47:48,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:48,482 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-23 06:47:48,486 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 22 treesize of output 16 [2022-11-23 06:47:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 06:47:48,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459231328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:48,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:48,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 14] total 43 [2022-11-23 06:47:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9533911] [2022-11-23 06:47:48,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:48,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-23 06:47:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-23 06:47:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1580, Unknown=1, NotChecked=80, Total=1806 [2022-11-23 06:47:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:48,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:48,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 10.232558139534884) internal successors, (440), 43 states have internal predecessors, (440), 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-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:48,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:47:48,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:47:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:47:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-23 06:47:52,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-23 06:47:52,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:52,795 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:47:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:47:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1269696636, now seen corresponding path program 2 times [2022-11-23 06:47:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:47:52,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828841240] [2022-11-23 06:47:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:47:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:47:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:47:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:54,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:47:54,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828841240] [2022-11-23 06:47:54,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828841240] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:47:54,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090020489] [2022-11-23 06:47:54,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 06:47:54,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:47:54,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:47:54,075 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:47:54,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-23 06:47:57,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 06:47:57,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:47:57,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-23 06:47:57,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:47:57,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:47:57,408 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 06:47:57,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 06:47:57,879 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 06:47:57,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 06:47:58,665 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 13 treesize of output 9 [2022-11-23 06:47:58,705 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 23 treesize of output 22 [2022-11-23 06:47:58,757 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 25 treesize of output 25 [2022-11-23 06:47:58,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:58,813 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:47:58,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:58,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:47:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:47:58,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:47:58,961 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6264 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_6264) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 4)) |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)) (forall ((v_ArrVal_6264 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_6264) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ 5 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|))))) is different from false [2022-11-23 06:47:58,972 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 5 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse1 |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_6264 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_6264) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 4)))) (forall ((v_ArrVal_6264 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_6264) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse1)))))) is different from false [2022-11-23 06:47:58,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:58,984 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 2 case distinctions, treesize of input 27 treesize of output 33 [2022-11-23 06:47:58,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:47:58,989 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 54 treesize of output 24 [2022-11-23 06:47:58,997 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-23 06:47:58,997 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2022-11-23 06:47:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 06:47:59,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090020489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:47:59,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:47:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 14] total 41 [2022-11-23 06:47:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543037592] [2022-11-23 06:47:59,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:47:59,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 06:47:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:47:59,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 06:47:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1414, Unknown=2, NotChecked=154, Total=1722 [2022-11-23 06:47:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:59,256 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:47:59,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 10.073170731707316) internal successors, (413), 42 states have internal predecessors, (413), 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-11-23 06:47:59,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:47:59,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:59,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:47:59,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:59,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:47:59,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:59,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:47:59,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:47:59,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-23 06:47:59,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:48:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:48:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:48:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:48:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:48:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:48:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:48:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-23 06:48:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:48:01,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-23 06:48:01,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:48:01,647 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:48:01,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:48:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1178334366, now seen corresponding path program 3 times [2022-11-23 06:48:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:48:01,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040111243] [2022-11-23 06:48:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:48:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:48:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:48:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 06:48:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:48:02,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040111243] [2022-11-23 06:48:02,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040111243] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:48:02,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267078130] [2022-11-23 06:48:02,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 06:48:02,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:48:02,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:48:02,918 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:48:02,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-23 06:53:53,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 06:53:53,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:53:53,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 06:53:53,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:53:54,239 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 13 treesize of output 9 [2022-11-23 06:53:54,276 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 23 treesize of output 22 [2022-11-23 06:53:54,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:54,326 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:53:54,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:53:54,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:53:54,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:53:54,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:54,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:53:54,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:54,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:53:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 06:53:54,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:53:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 06:53:55,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267078130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:53:55,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:53:55,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 14] total 41 [2022-11-23 06:53:55,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827078085] [2022-11-23 06:53:55,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:53:55,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 06:53:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:53:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 06:53:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 06:53:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:55,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:53:55,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 12.390243902439025) internal successors, (508), 42 states have internal predecessors, (508), 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-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:53:55,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:53:55,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:53:55,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-23 06:53:55,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:53:55,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:53:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:53:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:53:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:53:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-23 06:53:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:53:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:53:57,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-23 06:53:57,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:53:57,281 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1_funErr5ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:53:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:53:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1175416956, now seen corresponding path program 4 times [2022-11-23 06:53:57,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:53:57,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552266690] [2022-11-23 06:53:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:53:57,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:53:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:53:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 06:53:58,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:53:58,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552266690] [2022-11-23 06:53:58,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552266690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:53:58,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357145389] [2022-11-23 06:53:58,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 06:53:58,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:53:58,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:53:58,142 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:53:58,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-23 06:53:58,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 06:53:58,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:53:58,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 06:53:58,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:53:58,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:53:58,864 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:53:58,865 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-11-23 06:53:59,020 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:53:59,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:53:59,203 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 13 treesize of output 9 [2022-11-23 06:53:59,214 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 23 treesize of output 22 [2022-11-23 06:53:59,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:59,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:53:59,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:59,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:53:59,262 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 43 treesize of output 39 [2022-11-23 06:53:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 06:53:59,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:53:59,441 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base| (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse1 |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse1))) (forall ((v_ArrVal_7025 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ 5 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|)) |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)) (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 6)))) (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 4))))))) is different from false [2022-11-23 06:53:59,461 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 6)) (.cse2 (+ 7 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base| (store (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse1 |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|) .cse2 |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse1))) (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 4)))) (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ 5 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|)))) (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse2)))))) is different from false [2022-11-23 06:53:59,481 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|)) (.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 6)) (.cse3 (+ 7 |c_t1_funThread1of3ForFork1_insert_~node#1.offset|))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse2 |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|) .cse1 |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|) .cse3 |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)))) (and (forall ((v_ArrVal_7025 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse1) |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)) (forall ((v_ArrVal_7025 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse2) |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1|)) (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~node#1.offset| 4)))) (forall ((v_ArrVal_7025 (Array Int Int))) (= |c_t1_funThread1of3ForFork1_insert_#t~nondet13#1| (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7025) |c_t1_funThread1of3ForFork1_insert_~node#1.base|) .cse3)))))) is different from false [2022-11-23 06:53:59,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:59,507 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 37 treesize of output 53 [2022-11-23 06:53:59,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:53:59,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2022-11-23 06:53:59,522 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:53:59,522 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:53:59,530 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:53:59,530 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:53:59,538 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:53:59,538 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:53:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 06:53:59,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357145389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:53:59,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:53:59,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 14] total 24 [2022-11-23 06:53:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099363528] [2022-11-23 06:53:59,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:53:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 06:53:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:53:59,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 06:53:59,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=391, Unknown=13, NotChecked=126, Total=600 [2022-11-23 06:53:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:59,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:53:59,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 11.875) internal successors, (285), 25 states have internal predecessors, (285), 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-11-23 06:53:59,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:53:59,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:59,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:59,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:53:59,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-23 06:54:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 06:54:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:04,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:04,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:04,458 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:54:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1438744205, now seen corresponding path program 1 times [2022-11-23 06:54:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:04,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414672872] [2022-11-23 06:54:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:05,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:05,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414672872] [2022-11-23 06:54:05,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414672872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:05,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905863767] [2022-11-23 06:54:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:05,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:05,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:05,403 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:05,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 06:54:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:06,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-23 06:54:06,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:06,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:54:06,086 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:06,086 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-11-23 06:54:06,118 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:06,118 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-11-23 06:54:06,174 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:06,174 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-11-23 06:54:06,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:54:06,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:54:06,284 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 13 treesize of output 9 [2022-11-23 06:54:06,299 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 23 treesize of output 22 [2022-11-23 06:54:06,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:06,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:54:06,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:06,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:54:06,389 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 43 treesize of output 39 [2022-11-23 06:54:06,413 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 43 treesize of output 39 [2022-11-23 06:54:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:06,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:06,448 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7)) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0))) is different from false [2022-11-23 06:54:06,498 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_7343 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)))) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0))))) is different from false [2022-11-23 06:54:06,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse2 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0))))) is different from false [2022-11-23 06:54:06,599 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) (.cse3 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse2 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_7343 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7343) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) is different from false [2022-11-23 06:54:06,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:06,647 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 37 treesize of output 53 [2022-11-23 06:54:06,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:06,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2022-11-23 06:54:06,663 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:54:06,663 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:54:06,669 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:54:06,669 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:54:06,674 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:54:06,675 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:54:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:06,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905863767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:06,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:06,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2022-11-23 06:54:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596536297] [2022-11-23 06:54:06,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:06,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 06:54:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 06:54:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=232, Unknown=4, NotChecked=132, Total=420 [2022-11-23 06:54:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,997 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:06,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 13.65) internal successors, (273), 21 states have internal predecessors, (273), 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-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:06,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:06,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 06:54:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:08,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:08,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:08,706 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:54:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 346480827, now seen corresponding path program 1 times [2022-11-23 06:54:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:08,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881036501] [2022-11-23 06:54:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:09,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881036501] [2022-11-23 06:54:09,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881036501] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:09,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869487989] [2022-11-23 06:54:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:09,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:09,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:09,846 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:09,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-23 06:54:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:10,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-23 06:54:10,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:10,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:54:10,555 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:10,555 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-11-23 06:54:10,589 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:10,590 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-11-23 06:54:10,632 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:10,632 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-11-23 06:54:10,681 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:54:10,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:54:10,750 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 13 treesize of output 9 [2022-11-23 06:54:10,766 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 23 treesize of output 22 [2022-11-23 06:54:10,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:10,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:54:10,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:10,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:54:10,846 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 43 treesize of output 39 [2022-11-23 06:54:10,877 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 43 treesize of output 39 [2022-11-23 06:54:10,911 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 43 treesize of output 39 [2022-11-23 06:54:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:10,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:10,943 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7)) 0))) is different from false [2022-11-23 06:54:11,012 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0))))) is different from false [2022-11-23 06:54:11,066 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) 0))))) is different from false [2022-11-23 06:54:11,123 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) (.cse1 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse2 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7))) (let ((.cse0 (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4)) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse1) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse2) 0)) (forall ((v_ArrVal_7666 (Array Int Int))) (= (select (select (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_7666) |c_t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) is different from false [2022-11-23 06:54:11,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:11,179 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 37 treesize of output 53 [2022-11-23 06:54:11,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:11,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2022-11-23 06:54:11,195 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:54:11,195 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:54:11,200 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:54:11,200 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:54:11,214 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 06:54:11,216 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2022-11-23 06:54:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:11,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869487989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:11,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:11,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 20 [2022-11-23 06:54:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918168813] [2022-11-23 06:54:11,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:11,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 06:54:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:11,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 06:54:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=232, Unknown=4, NotChecked=132, Total=420 [2022-11-23 06:54:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:11,570 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:11,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 13.85) internal successors, (277), 21 states have internal predecessors, (277), 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-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:11,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:11,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:20,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:21,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-11-23 06:54:21,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-11-23 06:54:21,282 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:54:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash -358225506, now seen corresponding path program 1 times [2022-11-23 06:54:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:21,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527201602] [2022-11-23 06:54:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:22,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527201602] [2022-11-23 06:54:22,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527201602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:22,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129065085] [2022-11-23 06:54:22,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:22,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:22,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:22,746 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:22,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-23 06:54:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:23,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-23 06:54:23,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:23,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:54:23,497 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 06:54:23,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 06:54:23,549 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 06:54:23,550 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-11-23 06:54:23,596 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 06:54:23,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 06:54:23,848 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 06:54:23,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 06:54:24,137 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-11-23 06:54:24,224 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-11-23 06:54:24,268 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 21 treesize of output 20 [2022-11-23 06:54:24,355 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 23 treesize of output 23 [2022-11-23 06:54:24,372 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 23 treesize of output 23 [2022-11-23 06:54:24,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:24,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-23 06:54:24,462 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 32 treesize of output 30 [2022-11-23 06:54:24,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:24,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-23 06:54:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:54:24,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:24,608 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7964 (Array Int Int))) (= |c_t1_funThread3of3ForFork1_init_#t~nondet3#1| (select (select (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| v_ArrVal_7964) |c_t1_funThread3of3ForFork1_init_~p#1.base|) |c_t1_funThread3of3ForFork1_init_~p#1.offset|))) (forall ((v_ArrVal_7964 (Array Int Int))) (= |c_t1_funThread3of3ForFork1_init_#t~nondet3#1| (select (select (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| v_ArrVal_7964) |c_t1_funThread3of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 2)))) (forall ((v_ArrVal_7964 (Array Int Int))) (= |c_t1_funThread3of3ForFork1_init_#t~nondet3#1| (select (select (store |c_#race| |c_t1_funThread1of3ForFork1_insert_~list#1.base| v_ArrVal_7964) |c_t1_funThread3of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 1))))) is different from false [2022-11-23 06:54:24,623 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 |c_t1_funThread3of3ForFork1_init_#t~nondet3#1|)))) (and (forall ((v_ArrVal_7964 (Array Int Int))) (= |c_t1_funThread3of3ForFork1_init_#t~nondet3#1| (select (select (store .cse0 |c_t1_funThread1of3ForFork1_insert_~list#1.base| v_ArrVal_7964) |c_t1_funThread3of3ForFork1_init_~p#1.base|) (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 1)))) (forall ((v_ArrVal_7964 (Array Int Int))) (= |c_t1_funThread3of3ForFork1_init_#t~nondet3#1| (select (select (store .cse0 |c_t1_funThread1of3ForFork1_insert_~list#1.base| v_ArrVal_7964) |c_t1_funThread3of3ForFork1_init_~p#1.base|) |c_t1_funThread3of3ForFork1_init_~p#1.offset|))) (forall ((v_ArrVal_7964 (Array Int Int))) (= |c_t1_funThread3of3ForFork1_init_#t~nondet3#1| (select (select (store .cse0 |c_t1_funThread1of3ForFork1_insert_~list#1.base| v_ArrVal_7964) |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1)))))) is different from false [2022-11-23 06:54:24,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:54:24,997 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-23 06:54:25,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-11-23 06:54:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:54:25,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129065085] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:25,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:25,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 21] total 43 [2022-11-23 06:54:25,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069668633] [2022-11-23 06:54:25,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:25,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-23 06:54:25,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:25,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-23 06:54:25,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1509, Unknown=16, NotChecked=158, Total=1806 [2022-11-23 06:54:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:25,757 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:25,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.651162790697674) internal successors, (415), 43 states have internal predecessors, (415), 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-11-23 06:54:25,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:25,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:25,757 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:25,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:25,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:25,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:25,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:25,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-23 06:54:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 06:54:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-23 06:54:33,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-23 06:54:33,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-11-23 06:54:33,529 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:54:33,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:54:33,529 INFO L85 PathProgramCache]: Analyzing trace with hash -519215389, now seen corresponding path program 2 times [2022-11-23 06:54:33,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:54:33,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774553811] [2022-11-23 06:54:33,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:54:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:54:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:54:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:34,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:54:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774553811] [2022-11-23 06:54:34,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774553811] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:54:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035502151] [2022-11-23 06:54:34,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 06:54:34,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:54:34,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:54:34,678 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:54:34,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-23 06:54:36,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 06:54:36,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:54:36,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-23 06:54:36,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:54:36,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:54:36,290 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:54:36,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 06:54:36,395 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 06:54:36,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-23 06:54:36,809 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-11-23 06:54:36,810 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 3 case distinctions, treesize of input 21 treesize of output 38 [2022-11-23 06:54:37,492 INFO L321 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2022-11-23 06:54:37,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25 treesize of output 45 [2022-11-23 06:54:38,138 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 13 treesize of output 9 [2022-11-23 06:54:38,199 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 23 treesize of output 22 [2022-11-23 06:54:38,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:54:38,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:54:38,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:54:38,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-23 06:54:38,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 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-11-23 06:54:38,709 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 06:54:38,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:54:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 06:54:48,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035502151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 06:54:48,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 06:54:48,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 24, 16] total 51 [2022-11-23 06:54:48,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470193769] [2022-11-23 06:54:48,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 06:54:48,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-23 06:54:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 06:54:48,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-23 06:54:48,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2403, Unknown=0, NotChecked=0, Total=2652 [2022-11-23 06:54:48,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:48,832 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-23 06:54:48,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 9.254901960784315) internal successors, (472), 52 states have internal predecessors, (472), 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-11-23 06:54:48,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:54:48,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:48,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:54:48,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:48,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:54:48,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:48,834 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:54:48,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:54:48,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-23 06:54:48,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 06:55:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-23 06:55:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 06:55:12,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-23 06:55:12,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-23 06:55:12,654 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1_funErr3ASSERT_VIOLATIONDATA_RACE === [t1_funErr0ASSERT_VIOLATIONDATA_RACE, t1_funErr1ASSERT_VIOLATIONDATA_RACE, t1_funErr2ASSERT_VIOLATIONDATA_RACE, t1_funErr3ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2022-11-23 06:55:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 06:55:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1292486238, now seen corresponding path program 2 times [2022-11-23 06:55:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 06:55:12,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110346482] [2022-11-23 06:55:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 06:55:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 06:55:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 06:55:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:55:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 06:55:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110346482] [2022-11-23 06:55:14,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110346482] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 06:55:14,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579844563] [2022-11-23 06:55:14,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 06:55:14,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 06:55:14,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 [2022-11-23 06:55:14,717 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 06:55:14,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_024807b4-d594-471d-96d2-2d23a565e465/bin/ugemcutter-1C6z4D84am/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-23 06:55:15,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 06:55:15,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 06:55:15,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-23 06:55:15,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 06:55:16,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 06:55:16,215 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:55:16,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 06:55:16,746 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 13 treesize of output 9 [2022-11-23 06:55:16,833 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 23 treesize of output 22 [2022-11-23 06:55:16,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 06:55:17,019 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 34 treesize of output 32 [2022-11-23 06:55:17,121 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 34 treesize of output 32 [2022-11-23 06:55:17,174 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 34 treesize of output 32 [2022-11-23 06:55:17,220 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 34 treesize of output 32 [2022-11-23 06:55:17,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:17,302 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 06:55:17,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 50 [2022-11-23 06:55:17,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:17,410 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 06:55:17,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 62 [2022-11-23 06:55:17,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:17,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:17,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-11-23 06:55:17,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:17,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2022-11-23 06:55:17,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 06:55:17,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 06:55:17,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2022-11-23 06:55:17,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-11-23 06:55:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 06:55:17,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 06:55:22,341 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse17 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse12 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse3 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse6 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse7 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7)) (.cse9 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse5 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) (.cse10 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse8 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse0 (select .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse0 .cse1)) (= (select (select (let ((.cse2 (let ((.cse4 (store .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse0 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse15 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse11 (select .cse15 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse11 .cse12)) (= (select (select (let ((.cse13 (let ((.cse14 (store .cse15 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse11 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse14 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse14 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse13 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse13 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse20 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse16 (select .cse20 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse16 .cse17)) (= (select (select (let ((.cse18 (let ((.cse19 (store .cse20 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse16 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse19 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse19 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse18 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse18 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse24 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse21 (select .cse24 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse21 .cse17)) (= (select (select (let ((.cse22 (let ((.cse23 (store .cse24 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse21 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse23 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse23 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse22 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse22 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse28 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse25 (select .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse25 .cse17)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse25 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse32 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse29 (select .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse29 .cse1)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse29 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse36 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse33 (select .cse36 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse33 .cse12)) (= (select (select (let ((.cse34 (let ((.cse35 (store .cse36 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse33 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse35 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse35 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse34 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse34 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse40 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse37 (select .cse40 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse37 .cse12)) (= (select (select (let ((.cse38 (let ((.cse39 (store .cse40 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse37 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse38 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse38 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse44 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse41 (select .cse44 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse41 .cse17)) (= (select (select (let ((.cse42 (let ((.cse43 (store .cse44 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse41 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse42 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse42 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse48 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse45 (select .cse48 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse45 .cse1)) (= (select (select (let ((.cse46 (let ((.cse47 (store .cse48 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse45 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse47 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse47 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse46 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse46 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse52 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse49 (select .cse52 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse49 .cse12)) (= (select (select (let ((.cse50 (let ((.cse51 (store .cse52 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse49 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse51 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse51 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse50 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse50 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int)) (let ((.cse56 (store |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select |c_#race| |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse10 0)))) (let ((.cse53 (select .cse56 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse53 .cse1)) (= (select (select (let ((.cse54 (let ((.cse55 (store .cse56 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse53 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse55 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse55 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse54 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse54 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))))) is different from true [2022-11-23 06:55:24,049 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse9 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse3 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) (.cse4 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse8 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse5 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7)) (.cse18 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse6 (let ((.cse10 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse7 (select .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse0 (let ((.cse2 (store .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse7 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse7 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse14 (let ((.cse16 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse15 (select .cse14 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse12 (let ((.cse13 (store .cse14 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse15 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse13 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse13 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse15 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse21 (let ((.cse22 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse17 (select .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse17 .cse18)) (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse17 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse27 (let ((.cse28 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse23 (select .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse23 .cse24)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse23 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse32 (let ((.cse33 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse29 (select .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse29 .cse18)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse29 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse36 (let ((.cse38 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse37 (select .cse36 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse34 (let ((.cse35 (store .cse36 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse37 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse35 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse35 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse34 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse34 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse37 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse42 (let ((.cse43 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse39 (select .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse39 .cse24)) (= (select (select (let ((.cse40 (let ((.cse41 (store .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse39 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse47 (let ((.cse48 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse44 (select .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse44 .cse18)) (= (select (select (let ((.cse45 (let ((.cse46 (store .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse44 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse52 (let ((.cse53 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse49 (select .cse52 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse49 .cse24)) (= (select (select (let ((.cse50 (let ((.cse51 (store .cse52 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse49 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse51 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse51 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse50 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse50 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse57 (let ((.cse58 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse54 (select .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse54 .cse24)) (= (select (select (let ((.cse55 (let ((.cse56 (store .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse54 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse61 (let ((.cse63 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse62 (select .cse61 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse59 (let ((.cse60 (store .cse61 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse62 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse60 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse60 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse59 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse59 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse62 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse66 (let ((.cse68 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse67 (select .cse66 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse64 (let ((.cse65 (store .cse66 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse67 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse65 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse65 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse64 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse64 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse67 .cse18)))))))) is different from false [2022-11-23 06:55:26,062 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse24 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse9 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse3 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 5)) (.cse4 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 6)) (.cse8 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse5 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 7)) (.cse18 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_~list#1.offset| 4))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse6 (let ((.cse10 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse7 (select .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse0 (let ((.cse2 (store .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse7 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse7 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse14 (let ((.cse16 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse15 (select .cse14 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse12 (let ((.cse13 (store .cse14 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse15 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse13 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse13 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse15 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse21 (let ((.cse22 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse17 (select .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse17 .cse18)) (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse17 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse27 (let ((.cse28 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse23 (select .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse23 .cse24)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse23 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse32 (let ((.cse33 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse29 (select .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse29 .cse18)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse29 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse36 (let ((.cse38 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse37 (select .cse36 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse34 (let ((.cse35 (store .cse36 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse37 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse35 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse35 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse34 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse34 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse37 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse42 (let ((.cse43 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse39 (select .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse39 .cse24)) (= (select (select (let ((.cse40 (let ((.cse41 (store .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse39 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse47 (let ((.cse48 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse44 (select .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse44 .cse18)) (= (select (select (let ((.cse45 (let ((.cse46 (store .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse44 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse52 (let ((.cse53 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse49 (select .cse52 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse49 .cse24)) (= (select (select (let ((.cse50 (let ((.cse51 (store .cse52 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse49 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse51 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse51 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse50 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse50 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse57 (let ((.cse58 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse54 (select .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse54 .cse24)) (= (select (select (let ((.cse55 (let ((.cse56 (store .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse54 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse61 (let ((.cse63 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse62 (select .cse61 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse59 (let ((.cse60 (store .cse61 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse62 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse60 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse60 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse59 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse59 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse62 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse66 (let ((.cse68 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse67 (select .cse66 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse64 (let ((.cse65 (store .cse66 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse67 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse65 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse65 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse64 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse64 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse67 .cse18)))))))) is different from true [2022-11-23 06:55:28,834 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse24 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse3 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse5 (+ 5 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse6 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 6)) (.cse9 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse7 (+ 7 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 4))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse8 (let ((.cse10 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse0 (select .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse0 .cse1)) (= (select (select (let ((.cse2 (let ((.cse4 (store .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse0 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse16 (let ((.cse17 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse17 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse17 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse12 (select .cse16 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse12 .cse13)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse16 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse12 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse15 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse15 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse14 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse14 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse20 (let ((.cse22 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse21 (select .cse20 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse18 (let ((.cse19 (store .cse20 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse21 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse19 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse19 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse18 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse18 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse21 .cse13)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse27 (let ((.cse28 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse23 (select .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse23 .cse24)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse23 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse31 (let ((.cse33 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse32 (select .cse31 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse29 (let ((.cse30 (store .cse31 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse32 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse30 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse30 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse29 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse29 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse32 .cse13)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse37 (let ((.cse38 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse34 (select .cse37 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse34 .cse24)) (= 0 (select (select (let ((.cse35 (let ((.cse36 (store .cse37 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse34 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse36 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse36 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse35 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse35 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse41 (let ((.cse43 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse42 (select .cse41 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= 0 (select (select (let ((.cse39 (let ((.cse40 (store .cse41 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse42 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse40 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse40 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse39 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse39 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5)) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse42 .cse13)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse46 (let ((.cse48 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse47 (select .cse46 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= 0 (select (select (let ((.cse44 (let ((.cse45 (store .cse46 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse47 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse45 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse45 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse44 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse44 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5)) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse47 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse51 (let ((.cse53 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse52 (select .cse51 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse49 (let ((.cse50 (store .cse51 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse52 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse50 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse50 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse49 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse49 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse52 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse56 (let ((.cse58 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse57 (select .cse56 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse54 (let ((.cse55 (store .cse56 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse57 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse55 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse55 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse54 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse54 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse57 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse62 (let ((.cse63 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse59 (select .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse59 .cse24)) (= (select (select (let ((.cse60 (let ((.cse61 (store .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse59 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse67 (let ((.cse68 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse64 (select .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse64 .cse24)) (= (select (select (let ((.cse65 (let ((.cse66 (store .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse64 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))))) is different from false [2022-11-23 06:55:30,840 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse24 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse3 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse5 (+ 5 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse6 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 6)) (.cse9 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse7 (+ 7 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 4))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse8 (let ((.cse10 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse0 (select .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse0 .cse1)) (= (select (select (let ((.cse2 (let ((.cse4 (store .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse0 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse16 (let ((.cse17 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse17 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse17 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse12 (select .cse16 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse12 .cse13)) (= (select (select (let ((.cse14 (let ((.cse15 (store .cse16 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse12 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse15 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse15 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse14 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse14 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse20 (let ((.cse22 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse21 (select .cse20 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse18 (let ((.cse19 (store .cse20 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse21 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse19 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse19 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse18 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse18 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse21 .cse13)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse27 (let ((.cse28 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse28 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse23 (select .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse23 .cse24)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse27 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse23 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse26 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse25 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse31 (let ((.cse33 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse33 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse32 (select .cse31 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse29 (let ((.cse30 (store .cse31 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse32 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse30 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse30 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse29 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse29 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse32 .cse13)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse37 (let ((.cse38 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse38 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse34 (select .cse37 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse34 .cse24)) (= 0 (select (select (let ((.cse35 (let ((.cse36 (store .cse37 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse34 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse36 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse36 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse35 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse35 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse41 (let ((.cse43 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse43 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse42 (select .cse41 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= 0 (select (select (let ((.cse39 (let ((.cse40 (store .cse41 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse42 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse40 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse40 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse39 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse39 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5)) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse42 .cse13)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse46 (let ((.cse48 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse48 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse47 (select .cse46 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= 0 (select (select (let ((.cse44 (let ((.cse45 (store .cse46 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse47 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse45 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse45 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse44 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse44 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5)) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse47 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse51 (let ((.cse53 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse53 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse52 (select .cse51 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse49 (let ((.cse50 (store .cse51 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse52 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse50 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse50 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse49 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse49 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse52 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse56 (let ((.cse58 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse58 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse57 (select .cse56 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse54 (let ((.cse55 (store .cse56 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse57 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse55 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse55 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse54 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse54 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse57 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse62 (let ((.cse63 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse63 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse59 (select .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse59 .cse24)) (= (select (select (let ((.cse60 (let ((.cse61 (store .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse59 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse67 (let ((.cse68 (store |c_#race| |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse68 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse64 (select .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse64 .cse24)) (= (select (select (let ((.cse65 (let ((.cse66 (store .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse64 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))))) is different from true [2022-11-23 06:55:32,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (let ((.cse25 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse3 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse5 (+ 5 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse6 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 6)) (.cse9 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse7 (+ 7 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 4)) (.cse12 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse14 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse8 (let ((.cse10 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse0 (select .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse0 .cse1)) (= (select (select (let ((.cse2 (let ((.cse4 (store .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse0 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse13 (select .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse13 .cse14)) (= (select (select (let ((.cse15 (let ((.cse16 (store .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse13 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse21 (let ((.cse23 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse23 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse23 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse22 (select .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse22 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse22 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse28 (let ((.cse29 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse24 (select .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse24 .cse25)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse24 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse33 (let ((.cse34 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse30 (select .cse33 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse30 .cse14)) (= (select (select (let ((.cse31 (let ((.cse32 (store .cse33 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse30 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse32 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse32 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse31 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse31 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse38 (let ((.cse39 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse35 (select .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse35 .cse25)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse35 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse42 (let ((.cse44 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse43 (select .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse40 (let ((.cse41 (store .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse43 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse43 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse47 (let ((.cse49 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse48 (select .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse45 (let ((.cse46 (store .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse48 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse48 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse53 (let ((.cse54 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse50 (select .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse50 .cse25)) (= (select (select (let ((.cse51 (let ((.cse52 (store .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse50 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse58 (let ((.cse59 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse55 (select .cse58 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse55 .cse25)) (= (select (select (let ((.cse56 (let ((.cse57 (store .cse58 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse55 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse57 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse57 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse56 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse56 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse62 (let ((.cse64 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse63 (select .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse60 (let ((.cse61 (store .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse63 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse63 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse68 (let ((.cse69 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse65 (select .cse68 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse65 .cse1)) (= (select (select (let ((.cse66 (let ((.cse67 (store .cse68 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse65 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse67 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse67 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse66 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse66 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0)))))))) is different from false [2022-11-23 06:55:34,382 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (let ((.cse25 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse3 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse5 (+ 5 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse6 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 6)) (.cse9 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse7 (+ 7 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 4)) (.cse12 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (select |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse14 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse8 (let ((.cse10 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse0 (select .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse0 .cse1)) (= (select (select (let ((.cse2 (let ((.cse4 (store .cse8 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse0 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse4 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse2 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse13 (select .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse13 .cse14)) (= (select (select (let ((.cse15 (let ((.cse16 (store .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse13 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse21 (let ((.cse23 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse23 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse23 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse22 (select .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse19 (let ((.cse20 (store .cse21 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse22 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse20 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse19 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse22 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse28 (let ((.cse29 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse24 (select .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse24 .cse25)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse24 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse33 (let ((.cse34 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse30 (select .cse33 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse30 .cse14)) (= (select (select (let ((.cse31 (let ((.cse32 (store .cse33 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse30 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse32 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse32 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse31 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse31 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse38 (let ((.cse39 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse35 (select .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse35 .cse25)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse35 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse42 (let ((.cse44 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse43 (select .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse40 (let ((.cse41 (store .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse43 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse43 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse47 (let ((.cse49 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse48 (select .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse45 (let ((.cse46 (store .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse48 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse48 .cse1)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse53 (let ((.cse54 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse50 (select .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse50 .cse25)) (= (select (select (let ((.cse51 (let ((.cse52 (store .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse50 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse58 (let ((.cse59 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse55 (select .cse58 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse55 .cse25)) (= (select (select (let ((.cse56 (let ((.cse57 (store .cse58 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse55 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse57 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse57 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse56 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse56 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse62 (let ((.cse64 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse63 (select .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse60 (let ((.cse61 (store .cse62 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse63 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse61 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse60 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse6) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse63 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse68 (let ((.cse69 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse65 (select .cse68 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse65 .cse1)) (= (select (select (let ((.cse66 (let ((.cse67 (store .cse68 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse65 .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse67 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse67 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5 0) .cse6 0) .cse7 0))))) (store .cse66 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse66 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse3 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse7) 0)))))))) is different from true [2022-11-23 06:55:37,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse9 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (let ((.cse20 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse3 (+ 5 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse4 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 6)) (.cse5 (+ 7 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse8 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 4)) (.cse12 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse14 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|) .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse6 (let ((.cse10 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse7 (select .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse0 (let ((.cse2 (store .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse7 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse7 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse13 (select .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse13 .cse14)) (= (select (select (let ((.cse15 (let ((.cse16 (store .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse13 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse24 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse24 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse19 (select .cse23 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse19 .cse20)) (= (select (select (let ((.cse21 (let ((.cse22 (store .cse23 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse19 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse21 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse21 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse28 (let ((.cse29 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse25 (select .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse25 .cse20)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse25 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse32 (let ((.cse34 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse33 (select .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse30 (let ((.cse31 (store .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse33 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse33 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse38 (let ((.cse39 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse35 (select .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse35 .cse9)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse35 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse42 (let ((.cse44 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse43 (select .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse40 (let ((.cse41 (store .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse43 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse43 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse47 (let ((.cse49 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse48 (select .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse45 (let ((.cse46 (store .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse48 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse48 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse53 (let ((.cse54 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse50 (select .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse50 .cse20)) (= (select (select (let ((.cse51 (let ((.cse52 (store .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse50 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse57 (let ((.cse59 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse58 (select .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse55 (let ((.cse56 (store .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse58 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse58 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse63 (let ((.cse64 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse60 (select .cse63 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse60 .cse20)) (= (select (select (let ((.cse61 (let ((.cse62 (store .cse63 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse60 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse62 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse62 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse61 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse61 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse67 (let ((.cse69 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse68 (select .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse65 (let ((.cse66 (store .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse68 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse68 .cse9))))))))) is different from false [2022-11-23 06:55:39,599 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (+ 5 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse9 (+ 6 |c_t1_funThread2of3ForFork1_init_~p#1.offset|))) (let ((.cse20 (+ 4 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse1 (+ |c_t1_funThread3of3ForFork1_init_~p#1.offset| 4)) (.cse3 (+ 5 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse4 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 6)) (.cse5 (+ 7 |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset|)) (.cse8 (+ 7 |c_t1_funThread2of3ForFork1_init_~p#1.offset|)) (.cse11 (+ |c_t1_funThread1of3ForFork1_insert_#in~list#1.offset| 4)) (.cse12 (store |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base| (store (store (select |c_#race| |c_t1_funThread2of3ForFork1_init_~p#1.base|) .cse14 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|) .cse9 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (and (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse6 (let ((.cse10 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse10 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse7 (select .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse0 (let ((.cse2 (store .cse6 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse7 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse2 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse0 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse7 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse17 (let ((.cse18 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse18 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse13 (select .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse13 .cse14)) (= (select (select (let ((.cse15 (let ((.cse16 (store .cse17 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse13 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse16 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse15 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse23 (let ((.cse24 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse24 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse24 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse19 (select .cse23 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse19 .cse20)) (= (select (select (let ((.cse21 (let ((.cse22 (store .cse23 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse19 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse22 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse21 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse21 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse28 (let ((.cse29 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse29 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse25 (select .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse25 .cse20)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse28 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse25 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse27 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse26 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse32 (let ((.cse34 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse34 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse33 (select .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse30 (let ((.cse31 (store .cse32 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse33 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse31 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse30 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse33 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse38 (let ((.cse39 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse39 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse35 (select .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse35 .cse9)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse38 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse35 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse37 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse36 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse42 (let ((.cse44 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse44 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse43 (select .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse40 (let ((.cse41 (store .cse42 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse43 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse41 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse40 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse43 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse47 (let ((.cse49 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse49 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse48 (select .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse45 (let ((.cse46 (store .cse47 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse48 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse46 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse45 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse4) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse48 .cse14)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse53 (let ((.cse54 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse54 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse50 (select .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse50 .cse20)) (= (select (select (let ((.cse51 (let ((.cse52 (store .cse53 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse50 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse52 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse51 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse57 (let ((.cse59 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse59 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse58 (select .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse55 (let ((.cse56 (store .cse57 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse58 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse56 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse55 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse58 .cse9)))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse63 (let ((.cse64 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse64 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse60 (select .cse63 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse60 .cse20)) (= (select (select (let ((.cse61 (let ((.cse62 (store .cse63 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse60 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse62 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse62 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse61 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse61 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse5) 0))))) (forall ((|t1_funThread1of3ForFork1_insert_~list#1.base| Int) (v_ArrVal_8606 Int) (v_ArrVal_8595 (Array Int Int))) (let ((.cse67 (let ((.cse69 (store .cse12 |c_t1_funThread3of3ForFork1_init_~p#1.base| v_ArrVal_8595))) (store .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (select .cse69 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11 0))))) (let ((.cse68 (select .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base|))) (or (= (select (select (let ((.cse65 (let ((.cse66 (store .cse67 |c_t1_funThread2of3ForFork1_init_~p#1.base| (store .cse68 .cse8 |c_t1_funThread2of3ForFork1_init_#t~nondet4#1|)))) (store .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base| (store (store (store (select .cse66 |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse3 0) .cse4 0) .cse5 0))))) (store .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base| (store (select .cse65 |c_t1_funThread3of3ForFork1_init_~p#1.base|) .cse1 v_ArrVal_8606))) |t1_funThread1of3ForFork1_insert_~list#1.base|) .cse11) 0) (= |c_t1_funThread2of3ForFork1_init_#t~nondet4#1| (select .cse68 .cse9))))))))) is different from true [2022-11-23 06:55:42,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:42,059 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 3 case distinctions, treesize of input 613 treesize of output 283 [2022-11-23 06:55:42,412 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 06:55:42,413 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 65403 treesize of output 62487 [2022-11-23 06:55:44,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:44,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26662 treesize of output 25122 [2022-11-23 06:55:45,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 06:55:45,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29401 treesize of output 28513