./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 02:15:54,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 02:15:54,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 02:15:54,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 02:15:54,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 02:15:54,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 02:15:54,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 02:15:54,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 02:15:54,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 02:15:54,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 02:15:54,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 02:15:54,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 02:15:54,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 02:15:54,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 02:15:54,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 02:15:54,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 02:15:54,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 02:15:54,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 02:15:54,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 02:15:54,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 02:15:54,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 02:15:54,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 02:15:54,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 02:15:54,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 02:15:54,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 02:15:54,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 02:15:54,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 02:15:54,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 02:15:54,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 02:15:54,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 02:15:54,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 02:15:54,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 02:15:54,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 02:15:54,421 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 02:15:54,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 02:15:54,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 02:15:54,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 02:15:54,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 02:15:54,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 02:15:54,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 02:15:54,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 02:15:54,426 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-23 02:15:54,462 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 02:15:54,463 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 02:15:54,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 02:15:54,463 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 02:15:54,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 02:15:54,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 02:15:54,471 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 02:15:54,471 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 02:15:54,471 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 02:15:54,471 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 02:15:54,471 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 02:15:54,472 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 02:15:54,472 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 02:15:54,472 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 02:15:54,472 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 02:15:54,472 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 02:15:54,473 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 02:15:54,473 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 02:15:54,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 02:15:54,474 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 02:15:54,474 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-23 02:15:54,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 02:15:54,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 02:15:54,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 02:15:54,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 02:15:54,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 02:15:54,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 02:15:54,475 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-23 02:15:54,476 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 02:15:54,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 02:15:54,476 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 02:15:54,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 02:15:54,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 02:15:54,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 02:15:54,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:15:54,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 02:15:54,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 02:15:54,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 02:15:54,478 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 02:15:54,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 02:15:54,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 02:15:54,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 02:15:54,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 02:15:54,479 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/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_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V 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 -> Taipan 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 -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2021-11-23 02:15:54,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 02:15:54,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 02:15:54,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 02:15:54,790 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 02:15:54,791 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 02:15:54,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2021-11-23 02:15:54,855 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/data/042be28d6/be957d3b1acd45daaf1cc56d9dd3d3dc/FLAGe53028c8e [2021-11-23 02:15:55,465 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 02:15:55,466 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2021-11-23 02:15:55,485 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/data/042be28d6/be957d3b1acd45daaf1cc56d9dd3d3dc/FLAGe53028c8e [2021-11-23 02:15:55,702 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/data/042be28d6/be957d3b1acd45daaf1cc56d9dd3d3dc [2021-11-23 02:15:55,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 02:15:55,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 02:15:55,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 02:15:55,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 02:15:55,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 02:15:55,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:15:55" (1/1) ... [2021-11-23 02:15:55,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387e2ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:55, skipping insertion in model container [2021-11-23 02:15:55,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:15:55" (1/1) ... [2021-11-23 02:15:55,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 02:15:55,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 02:15:56,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:15:56,225 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 02:15:56,269 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 02:15:56,330 INFO L208 MainTranslator]: Completed translation [2021-11-23 02:15:56,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56 WrapperNode [2021-11-23 02:15:56,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 02:15:56,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 02:15:56,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 02:15:56,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 02:15:56,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,388 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2021-11-23 02:15:56,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 02:15:56,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 02:15:56,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 02:15:56,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 02:15:56,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 02:15:56,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 02:15:56,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 02:15:56,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 02:15:56,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (1/1) ... [2021-11-23 02:15:56,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 02:15:56,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:15:56,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 02:15:56,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 02:15:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 02:15:56,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 02:15:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 02:15:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 02:15:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-23 02:15:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 02:15:56,559 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-23 02:15:56,559 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-23 02:15:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 02:15:56,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 02:15:56,561 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-23 02:15:56,735 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 02:15:56,737 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 02:15:56,989 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 02:15:56,998 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 02:15:56,998 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-23 02:15:57,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:57 BoogieIcfgContainer [2021-11-23 02:15:57,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 02:15:57,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 02:15:57,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 02:15:57,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 02:15:57,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:15:55" (1/3) ... [2021-11-23 02:15:57,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ffe5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:15:57, skipping insertion in model container [2021-11-23 02:15:57,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:15:56" (2/3) ... [2021-11-23 02:15:57,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ffe5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:15:57, skipping insertion in model container [2021-11-23 02:15:57,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:15:57" (3/3) ... [2021-11-23 02:15:57,043 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2021-11-23 02:15:57,047 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-23 02:15:57,047 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 02:15:57,047 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-23 02:15:57,048 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-23 02:15:57,087 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,088 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,088 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,088 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,088 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,089 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,089 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,089 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,089 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,092 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,093 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,093 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,093 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,093 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,094 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,094 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,097 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,097 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,097 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,097 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,097 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,098 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,099 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,099 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,099 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,112 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,138 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,140 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,141 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,142 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,148 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,148 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,148 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,148 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,165 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,171 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,172 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-23 02:15:57,177 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-23 02:15:57,239 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 02:15:57,246 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 02:15:57,261 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-11-23 02:15:57,277 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-23 02:15:57,305 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-23 02:15:57,316 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-23 02:15:57,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 261 flow [2021-11-23 02:15:57,412 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2021-11-23 02:15:57,413 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-23 02:15:57,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 232 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2021-11-23 02:15:57,426 INFO L116 LiptonReduction]: Number of co-enabled transitions 4864 [2021-11-23 02:15:59,778 INFO L131 LiptonReduction]: Checked pairs total: 16173 [2021-11-23 02:15:59,778 INFO L133 LiptonReduction]: Total number of compositions: 75 [2021-11-23 02:15:59,806 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 56 transitions, 117 flow [2021-11-23 02:15:59,841 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 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) [2021-11-23 02:15:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 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) [2021-11-23 02:15:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 02:15:59,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:15:59,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:15:59,853 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:15:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:15:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2114734191, now seen corresponding path program 1 times [2021-11-23 02:15:59,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:15:59,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427540855] [2021-11-23 02:15:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:15:59,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:00,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:00,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427540855] [2021-11-23 02:16:00,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427540855] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:00,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:00,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 02:16:00,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877818787] [2021-11-23 02:16:00,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:00,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:16:00,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:00,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:16:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:00,125 INFO L87 Difference]: Start difference. First operand has 595 states, 581 states have (on average 2.044750430292599) internal successors, (1188), 594 states have internal predecessors, (1188), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:00,208 INFO L93 Difference]: Finished difference Result 596 states and 1189 transitions. [2021-11-23 02:16:00,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:16:00,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-23 02:16:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:00,229 INFO L225 Difference]: With dead ends: 596 [2021-11-23 02:16:00,229 INFO L226 Difference]: Without dead ends: 596 [2021-11-23 02:16:00,230 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:00,234 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:00,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:16:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-23 02:16:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-11-23 02:16:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 582 states have (on average 2.042955326460481) internal successors, (1189), 595 states have internal predecessors, (1189), 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) [2021-11-23 02:16:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1189 transitions. [2021-11-23 02:16:00,312 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1189 transitions. Word has length 11 [2021-11-23 02:16:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:00,313 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 1189 transitions. [2021-11-23 02:16:00,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1189 transitions. [2021-11-23 02:16:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-23 02:16:00,315 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:00,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:00,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 02:16:00,315 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1783178182, now seen corresponding path program 1 times [2021-11-23 02:16:00,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:00,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126453687] [2021-11-23 02:16:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:00,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:00,396 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:00,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126453687] [2021-11-23 02:16:00,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126453687] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:00,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478841683] [2021-11-23 02:16:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:00,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:00,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:00,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:00,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 02:16:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:00,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:16:00,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:00,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:00,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478841683] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:00,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [497163319] [2021-11-23 02:16:00,560 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:16:00,569 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:00,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-23 02:16:00,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616080487] [2021-11-23 02:16:00,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:00,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:16:00,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:00,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:16:00,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:16:00,573 INFO L87 Difference]: Start difference. First operand 596 states and 1189 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:00,691 INFO L93 Difference]: Finished difference Result 599 states and 1192 transitions. [2021-11-23 02:16:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-23 02:16:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:00,697 INFO L225 Difference]: With dead ends: 599 [2021-11-23 02:16:00,712 INFO L226 Difference]: Without dead ends: 599 [2021-11-23 02:16:00,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:16:00,714 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:00,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-23 02:16:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-23 02:16:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 585 states have (on average 2.0376068376068375) internal successors, (1192), 598 states have internal predecessors, (1192), 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) [2021-11-23 02:16:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1192 transitions. [2021-11-23 02:16:00,770 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1192 transitions. Word has length 12 [2021-11-23 02:16:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:00,770 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 1192 transitions. [2021-11-23 02:16:00,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1192 transitions. [2021-11-23 02:16:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:16:00,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:00,772 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:00,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:00,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:00,994 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -336848431, now seen corresponding path program 2 times [2021-11-23 02:16:00,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:00,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398927910] [2021-11-23 02:16:00,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:00,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:01,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:01,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398927910] [2021-11-23 02:16:01,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398927910] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:01,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916717760] [2021-11-23 02:16:01,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:16:01,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:01,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:01,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:01,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 02:16:01,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:16:01,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:16:01,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 02:16:01,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:01,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:16:01,285 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 02:16:01,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 02:16:01,338 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-23 02:16:01,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:16:01,402 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-23 02:16:01,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:16:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:16:01,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:16:01,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916717760] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:01,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:16:01,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2021-11-23 02:16:01,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714498114] [2021-11-23 02:16:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:01,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:01,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:01,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:01,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:16:01,428 INFO L87 Difference]: Start difference. First operand 599 states and 1192 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-11-23 02:16:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:01,966 INFO L93 Difference]: Finished difference Result 790 states and 1574 transitions. [2021-11-23 02:16:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 15 [2021-11-23 02:16:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:01,976 INFO L225 Difference]: With dead ends: 790 [2021-11-23 02:16:01,976 INFO L226 Difference]: Without dead ends: 790 [2021-11-23 02:16:01,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:16:01,978 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:01,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 38 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:16:01,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-11-23 02:16:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 726. [2021-11-23 02:16:02,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 712 states have (on average 2.0308988764044944) internal successors, (1446), 725 states have internal predecessors, (1446), 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) [2021-11-23 02:16:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1446 transitions. [2021-11-23 02:16:02,047 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1446 transitions. Word has length 15 [2021-11-23 02:16:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:02,047 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1446 transitions. [2021-11-23 02:16:02,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-11-23 02:16:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1446 transitions. [2021-11-23 02:16:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:16:02,049 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:02,049 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:02,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:02,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:02,250 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 202679984, now seen corresponding path program 1 times [2021-11-23 02:16:02,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:02,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325474465] [2021-11-23 02:16:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:02,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 02:16:02,297 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:02,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325474465] [2021-11-23 02:16:02,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325474465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:02,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:02,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 02:16:02,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625620737] [2021-11-23 02:16:02,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:02,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 02:16:02,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:02,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 02:16:02,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:02,300 INFO L87 Difference]: Start difference. First operand 726 states and 1446 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-23 02:16:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:02,354 INFO L93 Difference]: Finished difference Result 1028 states and 2050 transitions. [2021-11-23 02:16:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 02:16:02,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) Word has length 15 [2021-11-23 02:16:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:02,362 INFO L225 Difference]: With dead ends: 1028 [2021-11-23 02:16:02,362 INFO L226 Difference]: Without dead ends: 1028 [2021-11-23 02:16:02,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 02:16:02,365 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:02,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 02:16:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-23 02:16:02,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 743. [2021-11-23 02:16:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 729 states have (on average 2.0301783264746227) internal successors, (1480), 742 states have internal predecessors, (1480), 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) [2021-11-23 02:16:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1480 transitions. [2021-11-23 02:16:02,399 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1480 transitions. Word has length 15 [2021-11-23 02:16:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:02,399 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1480 transitions. [2021-11-23 02:16:02,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-11-23 02:16:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1480 transitions. [2021-11-23 02:16:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 02:16:02,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:02,405 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:02,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 02:16:02,405 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:02,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:02,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2013723712, now seen corresponding path program 1 times [2021-11-23 02:16:02,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30530942] [2021-11-23 02:16:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:02,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:02,542 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:02,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30530942] [2021-11-23 02:16:02,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30530942] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:02,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946247337] [2021-11-23 02:16:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:02,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:02,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:02,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:02,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 02:16:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:02,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 02:16:02,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:02,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 02:16:02,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946247337] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:02,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [373843080] [2021-11-23 02:16:02,748 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:16:02,754 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:02,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-23 02:16:02,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142710430] [2021-11-23 02:16:02,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:02,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-23 02:16:02,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:02,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-23 02:16:02,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:16:02,756 INFO L87 Difference]: Start difference. First operand 743 states and 1480 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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) [2021-11-23 02:16:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:02,848 INFO L93 Difference]: Finished difference Result 749 states and 1486 transitions. [2021-11-23 02:16:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:16:02,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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) Word has length 15 [2021-11-23 02:16:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:02,854 INFO L225 Difference]: With dead ends: 749 [2021-11-23 02:16:02,854 INFO L226 Difference]: Without dead ends: 749 [2021-11-23 02:16:02,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:16:02,855 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:02,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-11-23 02:16:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2021-11-23 02:16:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 735 states have (on average 2.0217687074829933) internal successors, (1486), 748 states have internal predecessors, (1486), 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) [2021-11-23 02:16:02,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1486 transitions. [2021-11-23 02:16:02,880 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1486 transitions. Word has length 15 [2021-11-23 02:16:02,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:02,880 INFO L470 AbstractCegarLoop]: Abstraction has 749 states and 1486 transitions. [2021-11-23 02:16:02,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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) [2021-11-23 02:16:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1486 transitions. [2021-11-23 02:16:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-23 02:16:02,881 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:02,881 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:02,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:03,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:03,095 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash -805061856, now seen corresponding path program 2 times [2021-11-23 02:16:03,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:03,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429482126] [2021-11-23 02:16:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:03,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:03,241 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:03,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429482126] [2021-11-23 02:16:03,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429482126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:03,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:03,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:16:03,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966517024] [2021-11-23 02:16:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:03,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:03,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:03,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:03,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:03,243 INFO L87 Difference]: Start difference. First operand 749 states and 1486 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-11-23 02:16:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:03,601 INFO L93 Difference]: Finished difference Result 839 states and 1666 transitions. [2021-11-23 02:16:03,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:03,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) Word has length 21 [2021-11-23 02:16:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:03,605 INFO L225 Difference]: With dead ends: 839 [2021-11-23 02:16:03,605 INFO L226 Difference]: Without dead ends: 839 [2021-11-23 02:16:03,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:03,607 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:03,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 26 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:16:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-23 02:16:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 807. [2021-11-23 02:16:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 794 states have (on average 2.017632241813602) internal successors, (1602), 806 states have internal predecessors, (1602), 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) [2021-11-23 02:16:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1602 transitions. [2021-11-23 02:16:03,632 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1602 transitions. Word has length 21 [2021-11-23 02:16:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:03,633 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 1602 transitions. [2021-11-23 02:16:03,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-11-23 02:16:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1602 transitions. [2021-11-23 02:16:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-23 02:16:03,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:03,634 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:03,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 02:16:03,634 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2074507123, now seen corresponding path program 1 times [2021-11-23 02:16:03,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:03,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502549011] [2021-11-23 02:16:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:03,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:03,758 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:03,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502549011] [2021-11-23 02:16:03,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502549011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:03,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:03,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:16:03,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805819345] [2021-11-23 02:16:03,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:03,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:03,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:03,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:03,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:03,761 INFO L87 Difference]: Start difference. First operand 807 states and 1602 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:04,324 INFO L93 Difference]: Finished difference Result 967 states and 1922 transitions. [2021-11-23 02:16:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:04,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-23 02:16:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:04,331 INFO L225 Difference]: With dead ends: 967 [2021-11-23 02:16:04,331 INFO L226 Difference]: Without dead ends: 935 [2021-11-23 02:16:04,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:04,332 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:04,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 39 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 02:16:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-11-23 02:16:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 902. [2021-11-23 02:16:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 889 states have (on average 2.0112485939257594) internal successors, (1788), 901 states have internal predecessors, (1788), 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) [2021-11-23 02:16:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1788 transitions. [2021-11-23 02:16:04,361 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1788 transitions. Word has length 27 [2021-11-23 02:16:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:04,361 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1788 transitions. [2021-11-23 02:16:04,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1788 transitions. [2021-11-23 02:16:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-23 02:16:04,363 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:04,363 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:04,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 02:16:04,363 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash -444468531, now seen corresponding path program 1 times [2021-11-23 02:16:04,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:04,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5317415] [2021-11-23 02:16:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:04,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:04,460 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:04,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5317415] [2021-11-23 02:16:04,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5317415] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:04,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 02:16:04,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 02:16:04,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118210658] [2021-11-23 02:16:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:04,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:04,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:04,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:04,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:04,461 INFO L87 Difference]: Start difference. First operand 902 states and 1788 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:04,753 INFO L93 Difference]: Finished difference Result 967 states and 1918 transitions. [2021-11-23 02:16:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-23 02:16:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:04,761 INFO L225 Difference]: With dead ends: 967 [2021-11-23 02:16:04,761 INFO L226 Difference]: Without dead ends: 967 [2021-11-23 02:16:04,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-23 02:16:04,762 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:04,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 27 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 02:16:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-11-23 02:16:04,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2021-11-23 02:16:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 954 states have (on average 2.010482180293501) internal successors, (1918), 966 states have internal predecessors, (1918), 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) [2021-11-23 02:16:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1918 transitions. [2021-11-23 02:16:04,790 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1918 transitions. Word has length 27 [2021-11-23 02:16:04,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:04,791 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1918 transitions. [2021-11-23 02:16:04,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1918 transitions. [2021-11-23 02:16:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 02:16:04,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:04,793 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:04,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 02:16:04,793 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1511693174, now seen corresponding path program 1 times [2021-11-23 02:16:04,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:04,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386811337] [2021-11-23 02:16:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:04,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 02:16:05,006 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:05,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386811337] [2021-11-23 02:16:05,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386811337] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:05,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980425251] [2021-11-23 02:16:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:05,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:05,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:05,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:05,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 02:16:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:05,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:16:05,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:05,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:16:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:05,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:16:05,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980425251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:05,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:16:05,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-23 02:16:05,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871249890] [2021-11-23 02:16:05,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:05,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:05,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:05,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:05,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:16:05,260 INFO L87 Difference]: Start difference. First operand 967 states and 1918 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:05,434 INFO L93 Difference]: Finished difference Result 2184 states and 4322 transitions. [2021-11-23 02:16:05,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:05,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-23 02:16:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:05,454 INFO L225 Difference]: With dead ends: 2184 [2021-11-23 02:16:05,455 INFO L226 Difference]: Without dead ends: 2184 [2021-11-23 02:16:05,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-11-23 02:16:05,457 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:05,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 120 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2021-11-23 02:16:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1024. [2021-11-23 02:16:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1011 states have (on average 1.9841740850642928) internal successors, (2006), 1023 states have internal predecessors, (2006), 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) [2021-11-23 02:16:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2006 transitions. [2021-11-23 02:16:05,509 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2006 transitions. Word has length 31 [2021-11-23 02:16:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:05,509 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2006 transitions. [2021-11-23 02:16:05,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2006 transitions. [2021-11-23 02:16:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 02:16:05,513 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:05,513 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:05,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:05,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:05,731 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:05,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash -782408396, now seen corresponding path program 2 times [2021-11-23 02:16:05,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:05,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626589329] [2021-11-23 02:16:05,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:05,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 02:16:05,881 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:05,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626589329] [2021-11-23 02:16:05,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626589329] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:05,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642855094] [2021-11-23 02:16:05,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:16:05,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:05,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:05,883 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:05,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 02:16:05,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:16:05,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:16:05,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:16:05,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:06,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:16:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:06,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:16:06,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642855094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:06,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:16:06,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-23 02:16:06,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009747134] [2021-11-23 02:16:06,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:06,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:06,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:06,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:06,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:16:06,084 INFO L87 Difference]: Start difference. First operand 1024 states and 2006 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:06,266 INFO L93 Difference]: Finished difference Result 2484 states and 4895 transitions. [2021-11-23 02:16:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:06,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-23 02:16:06,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:06,283 INFO L225 Difference]: With dead ends: 2484 [2021-11-23 02:16:06,284 INFO L226 Difference]: Without dead ends: 2484 [2021-11-23 02:16:06,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-11-23 02:16:06,285 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 170 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:06,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 122 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:06,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2021-11-23 02:16:06,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1037. [2021-11-23 02:16:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1024 states have (on average 1.984375) internal successors, (2032), 1036 states have internal predecessors, (2032), 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) [2021-11-23 02:16:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2032 transitions. [2021-11-23 02:16:06,327 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 2032 transitions. Word has length 31 [2021-11-23 02:16:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:06,328 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 2032 transitions. [2021-11-23 02:16:06,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 2032 transitions. [2021-11-23 02:16:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-23 02:16:06,329 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:06,329 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:06,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:06,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:06,549 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1917489978, now seen corresponding path program 3 times [2021-11-23 02:16:06,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:06,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942278477] [2021-11-23 02:16:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:06,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 02:16:06,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942278477] [2021-11-23 02:16:06,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942278477] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:06,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758611482] [2021-11-23 02:16:06,671 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:16:06,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:06,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:06,677 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:06,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 02:16:06,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:16:06,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:16:06,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 02:16:06,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:06,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:16:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:06,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 02:16:06,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758611482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 02:16:06,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 02:16:06,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-23 02:16:06,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006862196] [2021-11-23 02:16:06,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:16:06,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 02:16:06,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 02:16:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-23 02:16:06,932 INFO L87 Difference]: Start difference. First operand 1037 states and 2032 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:07,074 INFO L93 Difference]: Finished difference Result 1904 states and 3740 transitions. [2021-11-23 02:16:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 02:16:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-23 02:16:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:07,087 INFO L225 Difference]: With dead ends: 1904 [2021-11-23 02:16:07,087 INFO L226 Difference]: Without dead ends: 1904 [2021-11-23 02:16:07,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-23 02:16:07,088 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:07,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:07,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-11-23 02:16:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1049. [2021-11-23 02:16:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1036 states have (on average 1.9845559845559846) internal successors, (2056), 1048 states have internal predecessors, (2056), 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) [2021-11-23 02:16:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2056 transitions. [2021-11-23 02:16:07,135 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2056 transitions. Word has length 31 [2021-11-23 02:16:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:07,136 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 2056 transitions. [2021-11-23 02:16:07,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2056 transitions. [2021-11-23 02:16:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-23 02:16:07,138 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:07,138 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:07,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:07,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:07,361 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash -643420328, now seen corresponding path program 1 times [2021-11-23 02:16:07,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:07,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395406859] [2021-11-23 02:16:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:07,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:07,400 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:07,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395406859] [2021-11-23 02:16:07,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395406859] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:07,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304542515] [2021-11-23 02:16:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:07,401 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:07,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:07,402 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:07,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 02:16:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:07,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 02:16:07,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:07,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:07,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304542515] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:07,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052372948] [2021-11-23 02:16:07,597 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:16:07,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:07,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-23 02:16:07,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733302618] [2021-11-23 02:16:07,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:07,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 02:16:07,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:07,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 02:16:07,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:16:07,600 INFO L87 Difference]: Start difference. First operand 1049 states and 2056 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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) [2021-11-23 02:16:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:07,712 INFO L93 Difference]: Finished difference Result 2629 states and 5216 transitions. [2021-11-23 02:16:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 02:16:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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) Word has length 35 [2021-11-23 02:16:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:07,730 INFO L225 Difference]: With dead ends: 2629 [2021-11-23 02:16:07,730 INFO L226 Difference]: Without dead ends: 2629 [2021-11-23 02:16:07,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-23 02:16:07,731 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:07,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 154 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 02:16:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2021-11-23 02:16:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2494. [2021-11-23 02:16:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2494 states, 2481 states have (on average 2.047964530431278) internal successors, (5081), 2493 states have internal predecessors, (5081), 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) [2021-11-23 02:16:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5081 transitions. [2021-11-23 02:16:07,849 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5081 transitions. Word has length 35 [2021-11-23 02:16:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:07,849 INFO L470 AbstractCegarLoop]: Abstraction has 2494 states and 5081 transitions. [2021-11-23 02:16:07,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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) [2021-11-23 02:16:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5081 transitions. [2021-11-23 02:16:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:16:07,851 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:07,851 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:07,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:08,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:08,077 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash -329216545, now seen corresponding path program 1 times [2021-11-23 02:16:08,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:08,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625325721] [2021-11-23 02:16:08,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:08,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:08,490 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:08,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625325721] [2021-11-23 02:16:08,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625325721] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:08,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638850345] [2021-11-23 02:16:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:08,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:08,491 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:08,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 02:16:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:08,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-23 02:16:08,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:09,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:16:09,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:16:09,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:16:09,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:16:09,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:09,374 INFO L354 Elim1Store]: treesize reduction 122, result has 22.3 percent of original size [2021-11-23 02:16:09,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 68 [2021-11-23 02:16:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:09,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:09,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:09,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:10,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638850345] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:10,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [951936613] [2021-11-23 02:16:10,359 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:16:10,359 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:10,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:16:10,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789165860] [2021-11-23 02:16:10,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:10,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:16:10,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:16:10,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:16:10,361 INFO L87 Difference]: Start difference. First operand 2494 states and 5081 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:15,124 INFO L93 Difference]: Finished difference Result 10550 states and 21429 transitions. [2021-11-23 02:16:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-23 02:16:15,124 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:16:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:15,174 INFO L225 Difference]: With dead ends: 10550 [2021-11-23 02:16:15,175 INFO L226 Difference]: Without dead ends: 10550 [2021-11-23 02:16:15,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=595, Invalid=2267, Unknown=0, NotChecked=0, Total=2862 [2021-11-23 02:16:15,177 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 872 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:15,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [872 Valid, 245 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2936 Invalid, 0 Unknown, 35 Unchecked, 3.1s Time] [2021-11-23 02:16:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10550 states. [2021-11-23 02:16:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10550 to 6001. [2021-11-23 02:16:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6001 states, 5988 states have (on average 2.14812959251837) internal successors, (12863), 6000 states have internal predecessors, (12863), 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) [2021-11-23 02:16:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 12863 transitions. [2021-11-23 02:16:15,456 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 12863 transitions. Word has length 45 [2021-11-23 02:16:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:15,456 INFO L470 AbstractCegarLoop]: Abstraction has 6001 states and 12863 transitions. [2021-11-23 02:16:15,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:16:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 12863 transitions. [2021-11-23 02:16:15,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:16:15,460 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:15,460 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:15,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:15,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 02:16:15,685 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1700766169, now seen corresponding path program 1 times [2021-11-23 02:16:15,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306936119] [2021-11-23 02:16:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:15,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:15,904 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:15,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306936119] [2021-11-23 02:16:15,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306936119] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:15,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808691391] [2021-11-23 02:16:15,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:15,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:15,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:15,906 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:15,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 02:16:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:16,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:16:16,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:16,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:16:16,428 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-23 02:16:16,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2021-11-23 02:16:16,464 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-23 02:16:16,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 02:16:16,513 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-23 02:16:16,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:16:16,569 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-23 02:16:16,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:16:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:16,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:16,730 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-23 02:16:16,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 29 [2021-11-23 02:16:16,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 19 [2021-11-23 02:16:16,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-11-23 02:16:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:16,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808691391] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:16,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1212060742] [2021-11-23 02:16:16,930 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:16:16,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:16,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-23 02:16:16,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930102265] [2021-11-23 02:16:16,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:16,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-23 02:16:16,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 02:16:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-11-23 02:16:16,932 INFO L87 Difference]: Start difference. First operand 6001 states and 12863 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 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) [2021-11-23 02:16:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:16:23,577 INFO L93 Difference]: Finished difference Result 12679 states and 25789 transitions. [2021-11-23 02:16:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-11-23 02:16:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 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) Word has length 45 [2021-11-23 02:16:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:16:23,611 INFO L225 Difference]: With dead ends: 12679 [2021-11-23 02:16:23,611 INFO L226 Difference]: Without dead ends: 12679 [2021-11-23 02:16:23,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2220, Invalid=9336, Unknown=0, NotChecked=0, Total=11556 [2021-11-23 02:16:23,616 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 1333 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 6625 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 7461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 6625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:16:23,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1333 Valid, 334 Invalid, 7461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 6625 Invalid, 0 Unknown, 400 Unchecked, 4.0s Time] [2021-11-23 02:16:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2021-11-23 02:16:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 6071. [2021-11-23 02:16:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6071 states, 6058 states have (on average 2.146417959722681) internal successors, (13003), 6070 states have internal predecessors, (13003), 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) [2021-11-23 02:16:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 13003 transitions. [2021-11-23 02:16:23,901 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 13003 transitions. Word has length 45 [2021-11-23 02:16:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:16:23,902 INFO L470 AbstractCegarLoop]: Abstraction has 6071 states and 13003 transitions. [2021-11-23 02:16:23,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 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) [2021-11-23 02:16:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 13003 transitions. [2021-11-23 02:16:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:16:23,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:16:23,906 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:16:23,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 02:16:24,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 02:16:24,125 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:16:24,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:16:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1883138674, now seen corresponding path program 1 times [2021-11-23 02:16:24,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:16:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592996052] [2021-11-23 02:16:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:24,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:16:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:24,902 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:24,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:16:24,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592996052] [2021-11-23 02:16:24,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592996052] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:16:24,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569132094] [2021-11-23 02:16:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:16:24,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:16:24,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:16:24,905 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:16:24,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 02:16:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:16:25,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 02:16:25,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:16:25,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:16:25,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:16:25,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:16:25,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:16:25,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-23 02:16:25,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-23 02:16:25,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:25,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-23 02:16:26,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-23 02:16:26,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:16:26,314 INFO L354 Elim1Store]: treesize reduction 615, result has 10.7 percent of original size [2021-11-23 02:16:26,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 111 treesize of output 119 [2021-11-23 02:16:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:38,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:16:40,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:40,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:16:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:16:41,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569132094] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:16:41,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1097101247] [2021-11-23 02:16:41,186 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:16:41,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:16:41,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-23 02:16:41,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614769424] [2021-11-23 02:16:41,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:16:41,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-23 02:16:41,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:16:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-23 02:16:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1191, Unknown=5, NotChecked=0, Total=1482 [2021-11-23 02:16:41,188 INFO L87 Difference]: Start difference. First operand 6071 states and 13003 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:17:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:13,228 INFO L93 Difference]: Finished difference Result 12223 states and 24898 transitions. [2021-11-23 02:17:13,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-23 02:17:13,229 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:17:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:13,261 INFO L225 Difference]: With dead ends: 12223 [2021-11-23 02:17:13,261 INFO L226 Difference]: Without dead ends: 12223 [2021-11-23 02:17:13,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=1207, Invalid=4478, Unknown=15, NotChecked=0, Total=5700 [2021-11-23 02:17:13,264 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 857 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1363 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:13,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [857 Valid, 280 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3108 Invalid, 0 Unknown, 1363 Unchecked, 2.0s Time] [2021-11-23 02:17:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12223 states. [2021-11-23 02:17:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12223 to 6268. [2021-11-23 02:17:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 6255 states have (on average 2.143725019984013) internal successors, (13409), 6267 states have internal predecessors, (13409), 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) [2021-11-23 02:17:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13409 transitions. [2021-11-23 02:17:13,518 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13409 transitions. Word has length 45 [2021-11-23 02:17:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:13,518 INFO L470 AbstractCegarLoop]: Abstraction has 6268 states and 13409 transitions. [2021-11-23 02:17:13,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:17:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13409 transitions. [2021-11-23 02:17:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:17:13,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:13,522 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:13,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:13,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-23 02:17:13,749 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:17:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:13,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2029288535, now seen corresponding path program 1 times [2021-11-23 02:17:13,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:13,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882862878] [2021-11-23 02:17:13,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:13,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:17:14,132 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:14,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882862878] [2021-11-23 02:17:14,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882862878] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:14,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521991137] [2021-11-23 02:17:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:14,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:14,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:14,134 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:14,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 02:17:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:14,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:17:14,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:14,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:17:14,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:17:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:17:14,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:14,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:17:14,880 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:17:14,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-23 02:17:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:17:14,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:15,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:17:15,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521991137] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:17:15,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [640093993] [2021-11-23 02:17:15,619 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:17:15,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:17:15,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:17:15,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974926309] [2021-11-23 02:17:15,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:17:15,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:17:15,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:15,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:17:15,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:17:15,621 INFO L87 Difference]: Start difference. First operand 6268 states and 13409 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:17:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:24,114 INFO L93 Difference]: Finished difference Result 12441 states and 25326 transitions. [2021-11-23 02:17:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-23 02:17:24,114 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:17:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:24,144 INFO L225 Difference]: With dead ends: 12441 [2021-11-23 02:17:24,144 INFO L226 Difference]: Without dead ends: 12441 [2021-11-23 02:17:24,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2546 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1544, Invalid=6646, Unknown=0, NotChecked=0, Total=8190 [2021-11-23 02:17:24,148 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 1191 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 5144 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 5551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 5144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:24,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 293 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5144 Invalid, 0 Unknown, 82 Unchecked, 5.6s Time] [2021-11-23 02:17:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12441 states. [2021-11-23 02:17:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12441 to 6478. [2021-11-23 02:17:24,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6478 states, 6465 states have (on average 2.1415313225058004) internal successors, (13845), 6477 states have internal predecessors, (13845), 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) [2021-11-23 02:17:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 13845 transitions. [2021-11-23 02:17:24,386 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 13845 transitions. Word has length 45 [2021-11-23 02:17:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:24,386 INFO L470 AbstractCegarLoop]: Abstraction has 6478 states and 13845 transitions. [2021-11-23 02:17:24,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:17:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 13845 transitions. [2021-11-23 02:17:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:17:24,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:24,389 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:24,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:24,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:24,613 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:17:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:24,614 INFO L85 PathProgramCache]: Analyzing trace with hash -873806249, now seen corresponding path program 2 times [2021-11-23 02:17:24,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:24,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977444666] [2021-11-23 02:17:24,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:24,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:17:24,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:24,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977444666] [2021-11-23 02:17:24,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977444666] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:24,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276619240] [2021-11-23 02:17:24,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:17:24,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:24,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:24,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:24,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 02:17:24,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:17:24,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:17:24,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:17:24,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:25,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:17:25,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:17:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:17:25,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:17:25,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:25,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:17:25,542 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-23 02:17:25,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:17:25,673 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-23 02:17:25,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 67 [2021-11-23 02:17:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-23 02:17:25,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:26,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,254 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:17:26,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 59 [2021-11-23 02:17:26,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 57 [2021-11-23 02:17:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-23 02:17:26,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276619240] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:26,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:17:26,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-23 02:17:26,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183140888] [2021-11-23 02:17:26,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:17:26,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:17:26,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:26,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:17:26,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=574, Unknown=1, NotChecked=0, Total=702 [2021-11-23 02:17:26,600 INFO L87 Difference]: Start difference. First operand 6478 states and 13845 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:17:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:17:30,132 INFO L93 Difference]: Finished difference Result 8036 states and 17070 transitions. [2021-11-23 02:17:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 02:17:30,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:17:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:17:30,148 INFO L225 Difference]: With dead ends: 8036 [2021-11-23 02:17:30,148 INFO L226 Difference]: Without dead ends: 8036 [2021-11-23 02:17:30,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=913, Unknown=1, NotChecked=0, Total=1122 [2021-11-23 02:17:30,149 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 127 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-23 02:17:30,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 43 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-23 02:17:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8036 states. [2021-11-23 02:17:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8036 to 6615. [2021-11-23 02:17:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6615 states, 6602 states have (on average 2.1422296273856407) internal successors, (14143), 6614 states have internal predecessors, (14143), 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) [2021-11-23 02:17:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 14143 transitions. [2021-11-23 02:17:30,316 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 14143 transitions. Word has length 45 [2021-11-23 02:17:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:17:30,316 INFO L470 AbstractCegarLoop]: Abstraction has 6615 states and 14143 transitions. [2021-11-23 02:17:30,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:17:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 14143 transitions. [2021-11-23 02:17:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:17:30,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:17:30,320 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:17:30,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 02:17:30,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 02:17:30,533 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:17:30,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:17:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash -799626659, now seen corresponding path program 3 times [2021-11-23 02:17:30,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:17:30,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845670832] [2021-11-23 02:17:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:17:30,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:17:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:17:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:17:30,890 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:17:30,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845670832] [2021-11-23 02:17:30,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845670832] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:17:30,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382560146] [2021-11-23 02:17:30,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:17:30,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:17:30,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:17:30,893 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:17:30,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 02:17:31,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:17:31,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:17:31,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:17:31,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:17:31,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:17:31,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:17:31,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:17:31,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:17:31,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:17:31,815 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:17:31,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-23 02:17:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:17:31,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:17:33,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse2 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) is different from false [2021-11-23 02:17:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:17:53,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382560146] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:17:53,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1218586406] [2021-11-23 02:17:53,709 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:17:53,711 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:17:53,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:17:53,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537593686] [2021-11-23 02:17:53,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:17:53,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:17:53,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:17:53,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:17:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=790, Unknown=13, NotChecked=58, Total=992 [2021-11-23 02:17:53,713 INFO L87 Difference]: Start difference. First operand 6615 states and 14143 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:17:55,040 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (store .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)) (.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= (+ |c_~#cache~0.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3)) (= (select .cse0 .cse2) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse4 (select (let ((.cse6 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse6 |c_~#cache~0.base| (store (select .cse6 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse4 .cse5)) (= (select .cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (= (select .cse1 .cse3) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| 1)))) is different from false [2021-11-23 02:17:57,418 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (<= 1 (div (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (* |c_~#cache~0.offset| (- 1))) 28)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| 0))) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= (select .cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select .cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|)))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:18:26,780 WARN L227 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:18:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:18:55,549 INFO L93 Difference]: Finished difference Result 20437 states and 42757 transitions. [2021-11-23 02:18:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-23 02:18:55,549 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:18:55,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:18:55,630 INFO L225 Difference]: With dead ends: 20437 [2021-11-23 02:18:55,630 INFO L226 Difference]: Without dead ends: 20437 [2021-11-23 02:18:55,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 81.6s TimeCoverageRelationStatistics Valid=717, Invalid=4224, Unknown=41, NotChecked=420, Total=5402 [2021-11-23 02:18:55,632 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 706 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1410 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:18:55,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [706 Valid, 407 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2103 Invalid, 0 Unknown, 1410 Unchecked, 1.8s Time] [2021-11-23 02:18:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20437 states. [2021-11-23 02:18:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20437 to 11313. [2021-11-23 02:18:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11313 states, 11300 states have (on average 2.169115044247788) internal successors, (24511), 11312 states have internal predecessors, (24511), 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) [2021-11-23 02:18:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11313 states to 11313 states and 24511 transitions. [2021-11-23 02:18:56,048 INFO L78 Accepts]: Start accepts. Automaton has 11313 states and 24511 transitions. Word has length 45 [2021-11-23 02:18:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:18:56,049 INFO L470 AbstractCegarLoop]: Abstraction has 11313 states and 24511 transitions. [2021-11-23 02:18:56,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:18:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 11313 states and 24511 transitions. [2021-11-23 02:18:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:18:56,052 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:18:56,052 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:18:56,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 02:18:56,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 02:18:56,275 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:18:56,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:18:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1527646261, now seen corresponding path program 4 times [2021-11-23 02:18:56,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:18:56,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179508435] [2021-11-23 02:18:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:18:56,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:18:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:18:56,703 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:18:56,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179508435] [2021-11-23 02:18:56,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179508435] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:18:56,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437337101] [2021-11-23 02:18:56,703 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:18:56,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:18:56,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:18:56,709 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:18:56,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 02:18:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:18:56,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:18:56,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:18:57,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:18:57,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:18:57,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:18:57,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:18:57,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:18:57,456 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:18:57,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-23 02:18:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:18:57,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:19:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:19:32,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437337101] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:19:32,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [336107702] [2021-11-23 02:19:32,613 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:19:32,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:19:32,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:19:32,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529909125] [2021-11-23 02:19:32,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:19:32,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:19:32,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:19:32,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:19:32,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=845, Unknown=14, NotChecked=0, Total=992 [2021-11-23 02:19:32,618 INFO L87 Difference]: Start difference. First operand 11313 states and 24511 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:19:46,407 WARN L227 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:20:02,198 WARN L227 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:20:25,401 WARN L227 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:20:45,080 WARN L227 SmtUtils]: Spent 19.21s on a formula simplification. DAG size of input: 70 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 02:20:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:20:46,431 INFO L93 Difference]: Finished difference Result 21688 states and 46080 transitions. [2021-11-23 02:20:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-23 02:20:46,431 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:20:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:20:46,464 INFO L225 Difference]: With dead ends: 21688 [2021-11-23 02:20:46,465 INFO L226 Difference]: Without dead ends: 21688 [2021-11-23 02:20:46,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 104.9s TimeCoverageRelationStatistics Valid=1242, Invalid=5210, Unknown=28, NotChecked=0, Total=6480 [2021-11-23 02:20:46,467 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 761 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 4110 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 6106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 4110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1774 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:20:46,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 382 Invalid, 6106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 4110 Invalid, 0 Unknown, 1774 Unchecked, 3.8s Time] [2021-11-23 02:20:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21688 states. [2021-11-23 02:20:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21688 to 15622. [2021-11-23 02:20:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15622 states, 15609 states have (on average 2.1852136587865973) internal successors, (34109), 15621 states have internal predecessors, (34109), 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) [2021-11-23 02:20:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15622 states to 15622 states and 34109 transitions. [2021-11-23 02:20:47,063 INFO L78 Accepts]: Start accepts. Automaton has 15622 states and 34109 transitions. Word has length 45 [2021-11-23 02:20:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:20:47,064 INFO L470 AbstractCegarLoop]: Abstraction has 15622 states and 34109 transitions. [2021-11-23 02:20:47,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:20:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 15622 states and 34109 transitions. [2021-11-23 02:20:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:20:47,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:20:47,068 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:20:47,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 02:20:47,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:20:47,283 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:20:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:20:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1517537279, now seen corresponding path program 5 times [2021-11-23 02:20:47,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:20:47,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37761016] [2021-11-23 02:20:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:47,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:20:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:20:47,655 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:20:47,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37761016] [2021-11-23 02:20:47,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37761016] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:20:47,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209085952] [2021-11-23 02:20:47,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:20:47,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:20:47,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:20:47,657 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:20:47,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 02:20:47,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-23 02:20:47,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:20:47,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-23 02:20:47,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:20:47,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:20:48,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:20:48,112 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-23 02:20:48,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2021-11-23 02:20:48,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-23 02:20:48,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:20:48,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:48,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:20:48,384 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-23 02:20:48,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 67 [2021-11-23 02:20:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-23 02:20:48,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:20:48,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:48,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:49,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 59 [2021-11-23 02:20:49,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 57 [2021-11-23 02:20:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-23 02:20:49,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209085952] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 02:20:49,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 02:20:49,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-23 02:20:49,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348151701] [2021-11-23 02:20:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 02:20:49,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 02:20:49,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:20:49,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 02:20:49,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-11-23 02:20:49,206 INFO L87 Difference]: Start difference. First operand 15622 states and 34109 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:20:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:20:53,210 INFO L93 Difference]: Finished difference Result 18306 states and 39752 transitions. [2021-11-23 02:20:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 02:20:53,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:20:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:20:53,240 INFO L225 Difference]: With dead ends: 18306 [2021-11-23 02:20:53,240 INFO L226 Difference]: Without dead ends: 18306 [2021-11-23 02:20:53,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2021-11-23 02:20:53,241 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 89 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:20:53,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 33 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-23 02:20:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18306 states. [2021-11-23 02:20:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18306 to 15738. [2021-11-23 02:20:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15738 states, 15725 states have (on average 2.1838473767885533) internal successors, (34341), 15737 states have internal predecessors, (34341), 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) [2021-11-23 02:20:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15738 states to 15738 states and 34341 transitions. [2021-11-23 02:20:53,904 INFO L78 Accepts]: Start accepts. Automaton has 15738 states and 34341 transitions. Word has length 45 [2021-11-23 02:20:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:20:53,917 INFO L470 AbstractCegarLoop]: Abstraction has 15738 states and 34341 transitions. [2021-11-23 02:20:53,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:20:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 15738 states and 34341 transitions. [2021-11-23 02:20:53,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:20:53,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:20:53,921 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:20:53,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 02:20:54,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:20:54,123 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:20:54,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:20:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1517924159, now seen corresponding path program 6 times [2021-11-23 02:20:54,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:20:54,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370246095] [2021-11-23 02:20:54,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:20:54,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:20:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:20:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:20:54,473 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:20:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370246095] [2021-11-23 02:20:54,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370246095] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:20:54,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404462844] [2021-11-23 02:20:54,473 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:20:54,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:20:54,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:20:54,474 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:20:54,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 02:20:54,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:20:54,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:20:54,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-23 02:20:54,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:20:55,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:20:55,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:20:55,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:20:55,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-11-23 02:20:55,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:20:55,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-23 02:20:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:20:55,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:20:55,920 INFO L354 Elim1Store]: treesize reduction 222, result has 16.2 percent of original size [2021-11-23 02:20:55,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 57 [2021-11-23 02:20:55,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 53 [2021-11-23 02:20:55,928 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-23 02:20:55,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 60 treesize of output 42 [2021-11-23 02:20:55,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,974 INFO L354 Elim1Store]: treesize reduction 109, result has 28.3 percent of original size [2021-11-23 02:20:55,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 57 [2021-11-23 02:20:55,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 49 [2021-11-23 02:20:55,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-11-23 02:20:55,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:55,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:56,032 INFO L354 Elim1Store]: treesize reduction 107, result has 29.6 percent of original size [2021-11-23 02:20:56,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 57 [2021-11-23 02:20:56,040 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-23 02:20:56,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 57 [2021-11-23 02:20:56,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:56,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:56,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:56,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:20:56,065 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-23 02:20:56,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 28 [2021-11-23 02:20:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:20:56,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404462844] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:20:56,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1338818624] [2021-11-23 02:20:56,380 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:20:56,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:20:56,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-23 02:20:56,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072092213] [2021-11-23 02:20:56,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:20:56,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-23 02:20:56,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:20:56,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-23 02:20:56,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2021-11-23 02:20:56,383 INFO L87 Difference]: Start difference. First operand 15738 states and 34341 transitions. Second operand has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 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) [2021-11-23 02:21:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:05,657 INFO L93 Difference]: Finished difference Result 20691 states and 44029 transitions. [2021-11-23 02:21:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-23 02:21:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 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) Word has length 45 [2021-11-23 02:21:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:05,688 INFO L225 Difference]: With dead ends: 20691 [2021-11-23 02:21:05,688 INFO L226 Difference]: Without dead ends: 20691 [2021-11-23 02:21:05,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2021-11-23 02:21:05,691 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 735 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 4926 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 5161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 4926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:05,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [735 Valid, 412 Invalid, 5161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 4926 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2021-11-23 02:21:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20691 states. [2021-11-23 02:21:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20691 to 15777. [2021-11-23 02:21:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15777 states, 15764 states have (on average 2.1835194113169245) internal successors, (34421), 15776 states have internal predecessors, (34421), 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) [2021-11-23 02:21:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15777 states to 15777 states and 34421 transitions. [2021-11-23 02:21:06,122 INFO L78 Accepts]: Start accepts. Automaton has 15777 states and 34421 transitions. Word has length 45 [2021-11-23 02:21:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:06,124 INFO L470 AbstractCegarLoop]: Abstraction has 15777 states and 34421 transitions. [2021-11-23 02:21:06,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.4) internal successors, (102), 31 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) [2021-11-23 02:21:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15777 states and 34421 transitions. [2021-11-23 02:21:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:21:06,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:06,128 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:21:06,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 02:21:06,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:06,341 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:21:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1069772857, now seen corresponding path program 2 times [2021-11-23 02:21:06,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:06,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283023190] [2021-11-23 02:21:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:06,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:06,701 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:06,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283023190] [2021-11-23 02:21:06,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283023190] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:21:06,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487345897] [2021-11-23 02:21:06,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:21:06,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:06,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:21:06,706 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:21:06,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 02:21:06,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:21:06,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:21:06,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 02:21:06,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:21:07,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:21:07,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:21:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:21:07,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:21:07,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:07,606 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-23 02:21:07,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 67 [2021-11-23 02:21:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:07,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:21:07,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:07,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:07,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:08,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:08,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:08,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:08,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:08,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:08,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:08,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487345897] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:21:08,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1703366749] [2021-11-23 02:21:08,391 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:21:08,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:21:08,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:21:08,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216431604] [2021-11-23 02:21:08,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:21:08,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:21:08,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:08,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:21:08,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:21:08,409 INFO L87 Difference]: Start difference. First operand 15777 states and 34421 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:21:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:12,774 INFO L93 Difference]: Finished difference Result 31133 states and 67057 transitions. [2021-11-23 02:21:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-23 02:21:12,782 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:21:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:12,837 INFO L225 Difference]: With dead ends: 31133 [2021-11-23 02:21:12,837 INFO L226 Difference]: Without dead ends: 31133 [2021-11-23 02:21:12,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=659, Invalid=2311, Unknown=0, NotChecked=0, Total=2970 [2021-11-23 02:21:12,841 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 936 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3889 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 4422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 3889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:12,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 385 Invalid, 4422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 3889 Invalid, 0 Unknown, 359 Unchecked, 3.4s Time] [2021-11-23 02:21:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31133 states. [2021-11-23 02:21:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31133 to 20192. [2021-11-23 02:21:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20192 states, 20179 states have (on average 2.200753258337876) internal successors, (44409), 20191 states have internal predecessors, (44409), 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) [2021-11-23 02:21:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20192 states to 20192 states and 44409 transitions. [2021-11-23 02:21:13,431 INFO L78 Accepts]: Start accepts. Automaton has 20192 states and 44409 transitions. Word has length 45 [2021-11-23 02:21:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:13,431 INFO L470 AbstractCegarLoop]: Abstraction has 20192 states and 44409 transitions. [2021-11-23 02:21:13,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:21:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 20192 states and 44409 transitions. [2021-11-23 02:21:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:21:13,435 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:13,435 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:21:13,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 02:21:13,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:13,649 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:21:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -301776767, now seen corresponding path program 2 times [2021-11-23 02:21:13,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:13,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631121969] [2021-11-23 02:21:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:13,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:13,839 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631121969] [2021-11-23 02:21:13,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631121969] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:21:13,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675897022] [2021-11-23 02:21:13,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:21:13,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:13,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:21:13,845 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:21:13,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-23 02:21:13,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:21:13,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:21:13,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-23 02:21:13,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:21:14,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:21:14,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2021-11-23 02:21:14,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:21:14,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,311 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:21:14,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 32 [2021-11-23 02:21:14,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:14,356 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-23 02:21:14,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 44 [2021-11-23 02:21:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:14,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:21:16,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2021-11-23 02:21:16,308 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-23 02:21:16,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 29 [2021-11-23 02:21:16,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2021-11-23 02:21:16,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 20 [2021-11-23 02:21:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:16,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675897022] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:21:16,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [339821108] [2021-11-23 02:21:16,492 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:21:16,492 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:21:16,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-23 02:21:16,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138672215] [2021-11-23 02:21:16,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:21:16,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-23 02:21:16,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-23 02:21:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2021-11-23 02:21:16,495 INFO L87 Difference]: Start difference. First operand 20192 states and 44409 transitions. Second operand has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 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) [2021-11-23 02:21:19,212 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) is different from false [2021-11-23 02:21:22,117 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_~#cache~0.offset| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) is different from false [2021-11-23 02:21:24,780 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_~#cache~0.offset| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= 1 (div |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2021-11-23 02:21:26,875 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.offset| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2021-11-23 02:21:28,929 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2021-11-23 02:21:32,285 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.offset| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) is different from false [2021-11-23 02:21:34,703 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) is different from false [2021-11-23 02:21:36,772 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (< |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) is different from false [2021-11-23 02:21:39,624 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))) (and (< |c_ULTIMATE.start_main_~i~2#1| .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (< 0 .cse0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2021-11-23 02:21:42,959 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< (* 28 |c_ULTIMATE.start_main_~i~2#1|) .cse0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89| Int) (|ULTIMATE.start_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (store |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#race| |ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |v_ULTIMATE.start_cache_entry_addref_#t~nondet33#1_89|)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2021-11-23 02:21:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:44,014 INFO L93 Difference]: Finished difference Result 102497 states and 224258 transitions. [2021-11-23 02:21:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-11-23 02:21:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 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) Word has length 45 [2021-11-23 02:21:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:44,297 INFO L225 Difference]: With dead ends: 102497 [2021-11-23 02:21:44,298 INFO L226 Difference]: Without dead ends: 102497 [2021-11-23 02:21:44,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 8068 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=2639, Invalid=17986, Unknown=11, NotChecked=3234, Total=23870 [2021-11-23 02:21:44,301 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1670 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 9290 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 10249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 9290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 510 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:44,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 636 Invalid, 10249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 9290 Invalid, 0 Unknown, 510 Unchecked, 6.1s Time] [2021-11-23 02:21:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102497 states. [2021-11-23 02:21:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102497 to 49662. [2021-11-23 02:21:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49662 states, 49649 states have (on average 2.2183125541299926) internal successors, (110137), 49661 states have internal predecessors, (110137), 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) [2021-11-23 02:21:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49662 states to 49662 states and 110137 transitions. [2021-11-23 02:21:46,321 INFO L78 Accepts]: Start accepts. Automaton has 49662 states and 110137 transitions. Word has length 45 [2021-11-23 02:21:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:46,502 INFO L470 AbstractCegarLoop]: Abstraction has 49662 states and 110137 transitions. [2021-11-23 02:21:46,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.5714285714285716) internal successors, (100), 29 states have internal predecessors, (100), 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) [2021-11-23 02:21:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 49662 states and 110137 transitions. [2021-11-23 02:21:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:21:46,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:46,506 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:21:46,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-11-23 02:21:46,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-23 02:21:46,721 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:21:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash -349144457, now seen corresponding path program 3 times [2021-11-23 02:21:46,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:46,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782896737] [2021-11-23 02:21:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:46,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:46,921 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:46,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782896737] [2021-11-23 02:21:46,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782896737] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:21:46,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662296026] [2021-11-23 02:21:46,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:21:46,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:46,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:21:46,922 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:21:46,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-23 02:21:47,102 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:21:47,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:21:47,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-23 02:21:47,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:21:47,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:21:47,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:21:47,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-11-23 02:21:47,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:21:47,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:47,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:21:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:47,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:21:47,863 INFO L354 Elim1Store]: treesize reduction 83, result has 25.9 percent of original size [2021-11-23 02:21:47,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 43 [2021-11-23 02:21:47,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 29 [2021-11-23 02:21:47,869 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-23 02:21:47,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 34 [2021-11-23 02:21:47,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:47,901 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-23 02:21:47,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 39 [2021-11-23 02:21:47,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 27 [2021-11-23 02:21:47,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:47,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:21:47,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-11-23 02:21:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:48,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662296026] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:21:48,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [808012033] [2021-11-23 02:21:48,147 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:21:48,148 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:21:48,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-23 02:21:48,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431067980] [2021-11-23 02:21:48,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:21:48,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-23 02:21:48,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:21:48,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-23 02:21:48,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-11-23 02:21:48,150 INFO L87 Difference]: Start difference. First operand 49662 states and 110137 transitions. Second operand has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 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) [2021-11-23 02:21:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:21:53,975 INFO L93 Difference]: Finished difference Result 70002 states and 153387 transitions. [2021-11-23 02:21:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-23 02:21:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 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) Word has length 45 [2021-11-23 02:21:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:21:54,131 INFO L225 Difference]: With dead ends: 70002 [2021-11-23 02:21:54,131 INFO L226 Difference]: Without dead ends: 70002 [2021-11-23 02:21:54,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2088 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1401, Invalid=5405, Unknown=0, NotChecked=0, Total=6806 [2021-11-23 02:21:54,132 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 1118 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 4597 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 5096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 4597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:21:54,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1118 Valid, 310 Invalid, 5096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 4597 Invalid, 0 Unknown, 165 Unchecked, 3.6s Time] [2021-11-23 02:21:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70002 states. [2021-11-23 02:21:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70002 to 21085. [2021-11-23 02:21:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21085 states, 21072 states have (on average 2.1990793470007595) internal successors, (46339), 21084 states have internal predecessors, (46339), 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) [2021-11-23 02:21:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21085 states to 21085 states and 46339 transitions. [2021-11-23 02:21:55,247 INFO L78 Accepts]: Start accepts. Automaton has 21085 states and 46339 transitions. Word has length 45 [2021-11-23 02:21:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:21:55,247 INFO L470 AbstractCegarLoop]: Abstraction has 21085 states and 46339 transitions. [2021-11-23 02:21:55,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 30 states have internal predecessors, (101), 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) [2021-11-23 02:21:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21085 states and 46339 transitions. [2021-11-23 02:21:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:21:55,254 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:21:55,254 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:21:55,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-23 02:21:55,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:55,481 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:21:55,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:21:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash -484149272, now seen corresponding path program 2 times [2021-11-23 02:21:55,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:21:55,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083160498] [2021-11-23 02:21:55,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:21:55,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:21:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:21:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:21:56,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:21:56,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083160498] [2021-11-23 02:21:56,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083160498] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:21:56,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048273422] [2021-11-23 02:21:56,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:21:56,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:21:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:21:56,509 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:21:56,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-23 02:21:56,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:21:56,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:21:56,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-23 02:21:56,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:21:56,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:21:57,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:21:57,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:21:57,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:21:57,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-23 02:21:57,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-23 02:21:57,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-23 02:21:57,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-23 02:21:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:21:57,914 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:21:57,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-23 02:22:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:22:10,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:22:12,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:22:12,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048273422] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:22:12,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1014847993] [2021-11-23 02:22:12,909 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:22:12,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:22:12,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:22:12,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356216238] [2021-11-23 02:22:12,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:22:12,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:22:12,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:22:12,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1266, Unknown=5, NotChecked=0, Total=1560 [2021-11-23 02:22:12,913 INFO L87 Difference]: Start difference. First operand 21085 states and 46339 transitions. Second operand has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:22:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:41,572 INFO L93 Difference]: Finished difference Result 34470 states and 74021 transitions. [2021-11-23 02:22:41,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-23 02:22:41,572 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:22:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:41,649 INFO L225 Difference]: With dead ends: 34470 [2021-11-23 02:22:41,649 INFO L226 Difference]: Without dead ends: 34470 [2021-11-23 02:22:41,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=1096, Invalid=3859, Unknown=15, NotChecked=0, Total=4970 [2021-11-23 02:22:41,650 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 985 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 3183 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 6569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 3183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3188 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:41,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 336 Invalid, 6569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 3183 Invalid, 0 Unknown, 3188 Unchecked, 2.6s Time] [2021-11-23 02:22:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34470 states. [2021-11-23 02:22:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34470 to 21662. [2021-11-23 02:22:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21662 states, 21649 states have (on average 2.1923414476419234) internal successors, (47462), 21661 states have internal predecessors, (47462), 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) [2021-11-23 02:22:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21662 states to 21662 states and 47462 transitions. [2021-11-23 02:22:42,293 INFO L78 Accepts]: Start accepts. Automaton has 21662 states and 47462 transitions. Word has length 45 [2021-11-23 02:22:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:42,293 INFO L470 AbstractCegarLoop]: Abstraction has 21662 states and 47462 transitions. [2021-11-23 02:22:42,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:22:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 21662 states and 47462 transitions. [2021-11-23 02:22:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:22:42,296 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:42,296 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:22:42,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-23 02:22:42,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-23 02:22:42,501 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:22:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash 679382453, now seen corresponding path program 7 times [2021-11-23 02:22:42,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:42,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124379009] [2021-11-23 02:22:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:42,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:22:42,778 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:42,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124379009] [2021-11-23 02:22:42,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124379009] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:22:42,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616232044] [2021-11-23 02:22:42,778 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:22:42,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:22:42,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:22:42,779 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:22:42,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-23 02:22:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:42,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 02:22:42,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:22:43,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:22:43,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:22:43,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:22:43,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:43,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:22:43,433 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-23 02:22:43,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 70 [2021-11-23 02:22:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:22:43,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:22:43,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:43,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-23 02:22:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:22:44,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616232044] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:22:44,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2126973664] [2021-11-23 02:22:44,243 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:22:44,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:22:44,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:22:44,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82498858] [2021-11-23 02:22:44,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:22:44,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:22:44,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:22:44,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:22:44,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2021-11-23 02:22:44,247 INFO L87 Difference]: Start difference. First operand 21662 states and 47462 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:22:52,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:22:52,628 INFO L93 Difference]: Finished difference Result 33286 states and 70988 transitions. [2021-11-23 02:22:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-11-23 02:22:52,629 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:22:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:22:52,697 INFO L225 Difference]: With dead ends: 33286 [2021-11-23 02:22:52,697 INFO L226 Difference]: Without dead ends: 33286 [2021-11-23 02:22:52,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2245, Invalid=9097, Unknown=0, NotChecked=0, Total=11342 [2021-11-23 02:22:52,700 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 1137 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 5366 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 6021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 5366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-23 02:22:52,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1137 Valid, 425 Invalid, 6021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 5366 Invalid, 0 Unknown, 243 Unchecked, 5.0s Time] [2021-11-23 02:22:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33286 states. [2021-11-23 02:22:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33286 to 23356. [2021-11-23 02:22:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23356 states, 23343 states have (on average 2.177654971511802) internal successors, (50833), 23355 states have internal predecessors, (50833), 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) [2021-11-23 02:22:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23356 states to 23356 states and 50833 transitions. [2021-11-23 02:22:53,287 INFO L78 Accepts]: Start accepts. Automaton has 23356 states and 50833 transitions. Word has length 45 [2021-11-23 02:22:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:22:53,288 INFO L470 AbstractCegarLoop]: Abstraction has 23356 states and 50833 transitions. [2021-11-23 02:22:53,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:22:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 23356 states and 50833 transitions. [2021-11-23 02:22:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:22:53,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:22:53,290 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:22:53,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-23 02:22:53,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 02:22:53,490 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:22:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:22:53,491 INFO L85 PathProgramCache]: Analyzing trace with hash 911917160, now seen corresponding path program 3 times [2021-11-23 02:22:53,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:22:53,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547718236] [2021-11-23 02:22:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:22:53,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:22:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:22:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:22:54,216 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:22:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547718236] [2021-11-23 02:22:54,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547718236] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:22:54,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770234451] [2021-11-23 02:22:54,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:22:54,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:22:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:22:54,218 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:22:54,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-23 02:22:54,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:22:54,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:22:54,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-23 02:22:54,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:22:54,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:22:54,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:22:54,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:22:54,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:22:54,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:54,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-23 02:22:55,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-23 02:22:55,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-23 02:22:55,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-23 02:22:55,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:22:55,593 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:22:55,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-23 02:23:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:23:07,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:23:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:23:21,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770234451] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:23:21,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1270935508] [2021-11-23 02:23:21,239 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:23:21,239 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:23:21,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:23:21,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170620873] [2021-11-23 02:23:21,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:23:21,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:23:21,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:23:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:23:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1292, Unknown=8, NotChecked=0, Total=1560 [2021-11-23 02:23:21,240 INFO L87 Difference]: Start difference. First operand 23356 states and 50833 transitions. Second operand has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:23:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:23:51,583 INFO L93 Difference]: Finished difference Result 36373 states and 77495 transitions. [2021-11-23 02:23:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-23 02:23:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:23:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:23:51,642 INFO L225 Difference]: With dead ends: 36373 [2021-11-23 02:23:51,642 INFO L226 Difference]: Without dead ends: 36373 [2021-11-23 02:23:51,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=1045, Invalid=3906, Unknown=19, NotChecked=0, Total=4970 [2021-11-23 02:23:51,643 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 765 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3167 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 5902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 3167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2500 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:23:51,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 352 Invalid, 5902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 3167 Invalid, 0 Unknown, 2500 Unchecked, 2.1s Time] [2021-11-23 02:23:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36373 states. [2021-11-23 02:23:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36373 to 23316. [2021-11-23 02:23:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23316 states, 23303 states have (on average 2.1783032227610177) internal successors, (50761), 23315 states have internal predecessors, (50761), 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) [2021-11-23 02:23:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23316 states to 23316 states and 50761 transitions. [2021-11-23 02:23:52,066 INFO L78 Accepts]: Start accepts. Automaton has 23316 states and 50761 transitions. Word has length 45 [2021-11-23 02:23:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:23:52,066 INFO L470 AbstractCegarLoop]: Abstraction has 23316 states and 50761 transitions. [2021-11-23 02:23:52,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:23:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 23316 states and 50761 transitions. [2021-11-23 02:23:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:23:52,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:23:52,068 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:23:52,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-23 02:23:52,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:52,269 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:23:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:23:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1752492082, now seen corresponding path program 4 times [2021-11-23 02:23:52,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:23:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861506806] [2021-11-23 02:23:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:23:52,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:23:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:23:52,792 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:23:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861506806] [2021-11-23 02:23:52,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861506806] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:23:52,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298647308] [2021-11-23 02:23:52,792 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:23:52,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:23:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:23:52,793 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:23:52,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-23 02:23:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:23:52,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-23 02:23:52,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:23:53,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:23:53,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:23:53,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:23:53,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:23:53,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-23 02:23:53,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-23 02:23:53,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,605 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-23 02:23:53,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-23 02:23:53,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:23:53,970 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:23:53,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-23 02:24:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:24:08,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:24:44,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (store (select .cse0 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse6 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-23 02:24:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:24:51,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298647308] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:24:51,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1209338914] [2021-11-23 02:24:51,296 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:24:51,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:24:51,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-23 02:24:51,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733567097] [2021-11-23 02:24:51,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:24:51,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-23 02:24:51,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:24:51,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-23 02:24:51,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1171, Unknown=16, NotChecked=72, Total=1482 [2021-11-23 02:24:51,297 INFO L87 Difference]: Start difference. First operand 23316 states and 50761 transitions. Second operand has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:24:53,985 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.offset| 0) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (store (select .cse0 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse6 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_~#cache~0.base| 1)) is different from false [2021-11-23 02:25:21,505 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= |c_~#cache~0.offset| 0) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:25:24,945 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))))) is different from false [2021-11-23 02:25:26,985 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse7 0)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_172|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_520| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))))) is different from false [2021-11-23 02:25:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:25:28,230 INFO L93 Difference]: Finished difference Result 92404 states and 199702 transitions. [2021-11-23 02:25:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-23 02:25:28,231 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:25:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:25:28,400 INFO L225 Difference]: With dead ends: 92404 [2021-11-23 02:25:28,400 INFO L226 Difference]: Without dead ends: 92404 [2021-11-23 02:25:28,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 90.4s TimeCoverageRelationStatistics Valid=717, Invalid=3695, Unknown=30, NotChecked=670, Total=5112 [2021-11-23 02:25:28,400 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 874 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 4614 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 8784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 4614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4003 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-23 02:25:28,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [874 Valid, 539 Invalid, 8784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 4614 Invalid, 0 Unknown, 4003 Unchecked, 3.3s Time] [2021-11-23 02:25:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92404 states. [2021-11-23 02:25:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92404 to 45808. [2021-11-23 02:25:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45808 states, 45795 states have (on average 2.1824216617534664) internal successors, (99944), 45807 states have internal predecessors, (99944), 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) [2021-11-23 02:25:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45808 states to 45808 states and 99944 transitions. [2021-11-23 02:25:29,811 INFO L78 Accepts]: Start accepts. Automaton has 45808 states and 99944 transitions. Word has length 45 [2021-11-23 02:25:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:25:29,811 INFO L470 AbstractCegarLoop]: Abstraction has 45808 states and 99944 transitions. [2021-11-23 02:25:29,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.710526315789474) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:25:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 45808 states and 99944 transitions. [2021-11-23 02:25:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:25:29,813 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:25:29,814 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:25:29,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-23 02:25:30,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-23 02:25:30,029 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:25:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:25:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1421222459, now seen corresponding path program 3 times [2021-11-23 02:25:30,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:25:30,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873740085] [2021-11-23 02:25:30,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:25:30,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:25:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:25:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:25:30,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:25:30,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873740085] [2021-11-23 02:25:30,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873740085] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:25:30,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756402] [2021-11-23 02:25:30,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:25:30,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:25:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:25:30,339 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:25:30,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-23 02:25:30,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:25:30,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:25:30,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-23 02:25:30,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:25:30,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:25:31,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:25:31,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:25:31,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:25:31,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:31,261 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-23 02:25:31,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 67 [2021-11-23 02:25:31,325 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:25:31,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:25:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:25:44,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756402] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:25:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1783227193] [2021-11-23 02:25:44,572 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:25:44,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:25:44,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:25:44,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222206971] [2021-11-23 02:25:44,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:25:44,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:25:44,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:25:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:25:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=840, Unknown=3, NotChecked=0, Total=992 [2021-11-23 02:25:44,575 INFO L87 Difference]: Start difference. First operand 45808 states and 99944 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:25:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:25:48,064 INFO L93 Difference]: Finished difference Result 55543 states and 120229 transitions. [2021-11-23 02:25:48,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-23 02:25:48,065 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:25:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:25:48,184 INFO L225 Difference]: With dead ends: 55543 [2021-11-23 02:25:48,184 INFO L226 Difference]: Without dead ends: 55543 [2021-11-23 02:25:48,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=558, Invalid=1989, Unknown=3, NotChecked=0, Total=2550 [2021-11-23 02:25:48,185 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 747 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 391 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-23 02:25:48,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [747 Valid, 329 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2797 Invalid, 0 Unknown, 391 Unchecked, 2.6s Time] [2021-11-23 02:25:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55543 states. [2021-11-23 02:25:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55543 to 45711. [2021-11-23 02:25:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45711 states, 45698 states have (on average 2.182765110070463) internal successors, (99748), 45710 states have internal predecessors, (99748), 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) [2021-11-23 02:25:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45711 states to 45711 states and 99748 transitions. [2021-11-23 02:25:49,260 INFO L78 Accepts]: Start accepts. Automaton has 45711 states and 99748 transitions. Word has length 45 [2021-11-23 02:25:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:25:49,260 INFO L470 AbstractCegarLoop]: Abstraction has 45711 states and 99748 transitions. [2021-11-23 02:25:49,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:25:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 45711 states and 99748 transitions. [2021-11-23 02:25:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:25:49,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:25:49,262 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:25:49,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-23 02:25:49,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-23 02:25:49,465 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:25:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:25:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash -418809313, now seen corresponding path program 4 times [2021-11-23 02:25:49,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:25:49,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513446973] [2021-11-23 02:25:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:25:49,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:25:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:25:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:25:49,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:25:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513446973] [2021-11-23 02:25:49,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513446973] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:25:49,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629877245] [2021-11-23 02:25:49,935 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-23 02:25:49,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:25:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:25:49,936 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:25:49,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-23 02:25:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:25:50,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-23 02:25:50,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:25:50,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:25:50,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:25:50,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:25:50,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:25:50,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:25:50,903 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-23 02:25:50,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 67 [2021-11-23 02:25:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:25:50,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:26:11,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3))))))) is different from false [2021-11-23 02:26:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:26:17,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629877245] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:26:17,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [387725569] [2021-11-23 02:26:17,234 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:26:17,235 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:26:17,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:26:17,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332860731] [2021-11-23 02:26:17,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:26:17,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:26:17,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:26:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:26:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=757, Unknown=12, NotChecked=58, Total=992 [2021-11-23 02:26:17,236 INFO L87 Difference]: Start difference. First operand 45711 states and 99748 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:26:18,694 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3))))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-23 02:26:20,756 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse1 .cse2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse4))))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:26:22,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse1 .cse2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse4))))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:26:23,641 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse1 .cse2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse4))))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:26:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:26:24,533 INFO L93 Difference]: Finished difference Result 155309 states and 338821 transitions. [2021-11-23 02:26:24,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-23 02:26:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:26:24,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:26:24,998 INFO L225 Difference]: With dead ends: 155309 [2021-11-23 02:26:24,998 INFO L226 Difference]: Without dead ends: 155309 [2021-11-23 02:26:24,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=474, Invalid=2182, Unknown=16, NotChecked=520, Total=3192 [2021-11-23 02:26:24,999 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 869 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 4033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 827 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-23 02:26:25,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 642 Invalid, 4033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 3120 Invalid, 0 Unknown, 827 Unchecked, 2.1s Time] [2021-11-23 02:26:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155309 states. [2021-11-23 02:26:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155309 to 86793. [2021-11-23 02:26:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86793 states, 86780 states have (on average 2.190988707075363) internal successors, (190134), 86792 states have internal predecessors, (190134), 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) [2021-11-23 02:26:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86793 states to 86793 states and 190134 transitions. [2021-11-23 02:26:28,304 INFO L78 Accepts]: Start accepts. Automaton has 86793 states and 190134 transitions. Word has length 45 [2021-11-23 02:26:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:26:28,304 INFO L470 AbstractCegarLoop]: Abstraction has 86793 states and 190134 transitions. [2021-11-23 02:26:28,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:26:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 86793 states and 190134 transitions. [2021-11-23 02:26:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:26:28,323 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:26:28,324 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:26:28,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-23 02:26:28,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:26:28,546 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:26:28,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:26:28,547 INFO L85 PathProgramCache]: Analyzing trace with hash -313349173, now seen corresponding path program 5 times [2021-11-23 02:26:28,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:26:28,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515429849] [2021-11-23 02:26:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:26:28,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:26:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:26:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:26:28,836 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:26:28,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515429849] [2021-11-23 02:26:28,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515429849] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:26:28,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658043639] [2021-11-23 02:26:28,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:26:28,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:26:28,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:26:28,837 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:26:28,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-23 02:26:28,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:26:28,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:26:28,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-23 02:26:28,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:26:29,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:26:29,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:26:29,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:26:29,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:26:29,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:26:29,707 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-23 02:26:29,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 67 [2021-11-23 02:26:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:26:29,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:27:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:27:01,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658043639] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:27:01,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1725074720] [2021-11-23 02:27:01,545 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:27:01,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:27:01,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:27:01,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249059600] [2021-11-23 02:27:01,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:27:01,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:27:01,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:27:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:27:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=831, Unknown=10, NotChecked=0, Total=992 [2021-11-23 02:27:01,547 INFO L87 Difference]: Start difference. First operand 86793 states and 190134 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:27:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:27:05,872 INFO L93 Difference]: Finished difference Result 98779 states and 216069 transitions. [2021-11-23 02:27:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-23 02:27:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:27:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:27:06,060 INFO L225 Difference]: With dead ends: 98779 [2021-11-23 02:27:06,060 INFO L226 Difference]: Without dead ends: 98779 [2021-11-23 02:27:06,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=742, Invalid=2440, Unknown=10, NotChecked=0, Total=3192 [2021-11-23 02:27:06,062 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 650 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-23 02:27:06,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 407 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 3768 Invalid, 0 Unknown, 830 Unchecked, 2.8s Time] [2021-11-23 02:27:06,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98779 states. [2021-11-23 02:27:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98779 to 45624. [2021-11-23 02:27:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45624 states, 45611 states have (on average 2.183091798031177) internal successors, (99573), 45623 states have internal predecessors, (99573), 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) [2021-11-23 02:27:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45624 states to 45624 states and 99573 transitions. [2021-11-23 02:27:07,489 INFO L78 Accepts]: Start accepts. Automaton has 45624 states and 99573 transitions. Word has length 45 [2021-11-23 02:27:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:27:07,489 INFO L470 AbstractCegarLoop]: Abstraction has 45624 states and 99573 transitions. [2021-11-23 02:27:07,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:27:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 45624 states and 99573 transitions. [2021-11-23 02:27:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:27:07,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:27:07,492 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:27:07,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-23 02:27:07,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:27:07,693 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:27:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:27:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -535588859, now seen corresponding path program 6 times [2021-11-23 02:27:07,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:27:07,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853080819] [2021-11-23 02:27:07,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:27:07,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:27:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:27:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:27:08,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:27:08,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853080819] [2021-11-23 02:27:08,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853080819] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:27:08,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911414675] [2021-11-23 02:27:08,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-23 02:27:08,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:27:08,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:27:08,021 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:27:08,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-23 02:27:08,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-23 02:27:08,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:27:08,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-23 02:27:08,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:27:08,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:27:08,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:27:08,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:27:08,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:27:08,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:08,859 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-23 02:27:08,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 67 [2021-11-23 02:27:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:27:08,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:27:11,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-23 02:27:13,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-23 02:27:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-23 02:27:13,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911414675] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:27:13,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1443660857] [2021-11-23 02:27:13,333 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:27:13,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:27:13,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-23 02:27:13,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761319692] [2021-11-23 02:27:13,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:27:13,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 02:27:13,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:27:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 02:27:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=739, Unknown=2, NotChecked=114, Total=992 [2021-11-23 02:27:13,335 INFO L87 Difference]: Start difference. First operand 45624 states and 99573 transitions. Second operand has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:27:14,878 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse3))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-23 02:27:15,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse3 |c_~#cache~0.base| (store (select .cse3 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse1)) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:27:17,670 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_~#cache~0.offset| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse4))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:27:19,042 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|))) (and (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse4 |c_~#cache~0.base| (store (select .cse4 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))))) is different from false [2021-11-23 02:27:20,925 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse4))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:27:22,068 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (= (select (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| Int)) (or (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) (.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2)) (.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse1 (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse2 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|) .cse4 |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1|)))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| 0))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse2)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse3)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (= |c_ULTIMATE.start_cache_entry_addref_#t~nondet33#1| (select .cse1 .cse4))))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_528| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:27:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:27:22,975 INFO L93 Difference]: Finished difference Result 114087 states and 247399 transitions. [2021-11-23 02:27:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-23 02:27:22,976 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:27:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:27:23,237 INFO L225 Difference]: With dead ends: 114087 [2021-11-23 02:27:23,237 INFO L226 Difference]: Without dead ends: 114087 [2021-11-23 02:27:23,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=289, Invalid=1541, Unknown=8, NotChecked=712, Total=2550 [2021-11-23 02:27:23,238 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 578 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-23 02:27:23,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [578 Valid, 638 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2301 Invalid, 0 Unknown, 602 Unchecked, 2.2s Time] [2021-11-23 02:27:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114087 states. [2021-11-23 02:27:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114087 to 86252. [2021-11-23 02:27:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86252 states, 86239 states have (on average 2.1882327021417223) internal successors, (188711), 86251 states have internal predecessors, (188711), 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) [2021-11-23 02:27:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86252 states to 86252 states and 188711 transitions. [2021-11-23 02:27:26,129 INFO L78 Accepts]: Start accepts. Automaton has 86252 states and 188711 transitions. Word has length 45 [2021-11-23 02:27:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 02:27:26,129 INFO L470 AbstractCegarLoop]: Abstraction has 86252 states and 188711 transitions. [2021-11-23 02:27:26,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:27:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 86252 states and 188711 transitions. [2021-11-23 02:27:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 02:27:26,132 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 02:27:26,132 INFO L514 BasicCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 02:27:26,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-23 02:27:26,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:27:26,333 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-23 02:27:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 02:27:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 20335220, now seen corresponding path program 5 times [2021-11-23 02:27:26,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 02:27:26,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829644728] [2021-11-23 02:27:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 02:27:26,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 02:27:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 02:27:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:27:27,121 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 02:27:27,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829644728] [2021-11-23 02:27:27,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829644728] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 02:27:27,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38682461] [2021-11-23 02:27:27,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 02:27:27,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 02:27:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 02:27:27,123 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 02:27:27,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77e10578-d0dc-4a23-8b93-067f93eb69b3/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-23 02:27:27,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 02:27:27,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 02:27:27,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-23 02:27:27,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 02:27:27,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-23 02:27:27,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-23 02:27:27,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-23 02:27:27,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:27,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2021-11-23 02:27:28,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2021-11-23 02:27:28,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-23 02:27:28,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2021-11-23 02:27:28,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2021-11-23 02:27:28,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:28,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-23 02:27:29,050 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-23 02:27:29,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 106 treesize of output 115 [2021-11-23 02:27:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:27:41,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 02:27:51,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse0 |c_~#cache~0.base| (store (store (store (store (select .cse0 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse4 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) is different from false [2021-11-23 02:28:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-23 02:28:02,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38682461] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 02:28:02,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [407681574] [2021-11-23 02:28:02,864 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-23 02:28:02,864 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 02:28:02,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-23 02:28:02,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442400382] [2021-11-23 02:28:02,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 02:28:02,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-23 02:28:02,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 02:28:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-23 02:28:02,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1246, Unknown=9, NotChecked=74, Total=1560 [2021-11-23 02:28:02,865 INFO L87 Difference]: Start difference. First operand 86252 states and 188711 transitions. Second operand has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 02:28:05,580 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse1 |c_~#cache~0.base| (store (store (store (store (select .cse1 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse5 0)))) (store .cse4 |c_~#cache~0.base| (store (store (store (store (select .cse4 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse6 |c_~#cache~0.base| (store (store (store (store (select .cse6 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) (= |c_~#cache~0.offset| 0) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:28:37,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse0 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse1) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse6 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse7 |c_~#cache~0.base| (store (store (store (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) (= |c_~#cache~0.offset| 0) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-23 02:29:17,794 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse0 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse1) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse6 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse7 |c_~#cache~0.base| (store (store (store (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:29:19,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse0 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))) (and (= (select .cse0 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0) (< (+ 3 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse1) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse2 |c_~#cache~0.base| (store (store (store (store (select .cse2 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse3 |c_~#cache~0.base| (store (store (store (store (select .cse3 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse6 0)))) (store .cse5 |c_~#cache~0.base| (store (store (store (store (select .cse5 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193| Int)) (= (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0)))) (store .cse7 |c_~#cache~0.base| (store (store (store (store (select .cse7 |c_~#cache~0.base|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_530| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_193|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1)) 0))))) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|))) is different from false [2021-11-23 02:29:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 02:29:23,884 INFO L93 Difference]: Finished difference Result 420198 states and 917826 transitions. [2021-11-23 02:29:23,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-23 02:29:23,884 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.641025641025641) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-23 02:29:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 02:29:24,933 INFO L225 Difference]: With dead ends: 420198 [2021-11-23 02:29:24,933 INFO L226 Difference]: Without dead ends: 420198 [2021-11-23 02:29:24,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 86 SyntacticMatches, 33 SemanticMatches, 101 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4875 ImplicationChecksByTransitivity, 108.5s TimeCoverageRelationStatistics Valid=1832, Invalid=7654, Unknown=40, NotChecked=980, Total=10506 [2021-11-23 02:29:24,934 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 968 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 5146 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 9387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 5146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4040 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-11-23 02:29:24,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [968 Valid, 505 Invalid, 9387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 5146 Invalid, 0 Unknown, 4040 Unchecked, 3.9s Time] [2021-11-23 02:29:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420198 states.