./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P --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 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:20:30,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:20:30,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:20:30,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:20:30,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:20:30,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:20:30,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:20:30,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:20:30,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:20:30,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:20:30,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:20:30,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:20:30,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:20:30,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:20:30,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:20:30,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:20:30,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:20:30,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:20:30,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:20:30,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:20:30,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:20:30,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:20:30,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:20:30,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:20:30,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:20:30,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:20:30,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:20:30,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:20:30,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:20:30,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:20:30,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:20:30,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:20:30,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:20:30,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:20:30,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:20:30,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:20:30,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:20:30,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:20:30,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:20:30,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:20:30,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:20:30,632 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-21 00:20:30,660 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:20:30,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:20:30,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:20:30,661 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:20:30,661 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:20:30,662 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:20:30,662 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:20:30,662 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:20:30,662 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:20:30,663 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:20:30,663 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:20:30,663 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:20:30,663 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:20:30,664 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:20:30,664 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:20:30,664 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:20:30,664 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:20:30,665 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:20:30,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:20:30,666 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:20:30,666 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-21 00:20:30,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:20:30,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:20:30,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:20:30,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:20:30,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:20:30,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:20:30,668 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-21 00:20:30,668 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:20:30,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:20:30,668 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:20:30,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:20:30,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:20:30,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:20:30,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:20:30,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:20:30,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:20:30,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:20:30,670 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:20:30,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:20:30,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:20:30,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:20:30,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:20:30,671 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_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/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_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P 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 -> 9e83a031749850377e0f1ecd2c361048b8f87f697f146600048034d31c93bd9a [2021-11-21 00:20:30,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:20:30,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:20:30,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:20:30,918 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:20:30,918 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:20:30,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2021-11-21 00:20:30,998 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/data/0b06e198b/5d2e819f41034df996d10b5761f5c6fe/FLAG7987c218a [2021-11-21 00:20:31,577 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:20:31,584 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/sv-benchmarks/c/goblint-regression/06-symbeq_05-funloop_hard2.i [2021-11-21 00:20:31,601 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/data/0b06e198b/5d2e819f41034df996d10b5761f5c6fe/FLAG7987c218a [2021-11-21 00:20:31,847 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/data/0b06e198b/5d2e819f41034df996d10b5761f5c6fe [2021-11-21 00:20:31,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:20:31,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:20:31,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:20:31,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:20:31,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:20:31,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:20:31" (1/1) ... [2021-11-21 00:20:31,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@180ea9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:31, skipping insertion in model container [2021-11-21 00:20:31,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:20:31" (1/1) ... [2021-11-21 00:20:31,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:20:31,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:20:32,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:20:32,409 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:20:32,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:20:32,556 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:20:32,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32 WrapperNode [2021-11-21 00:20:32,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:20:32,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:20:32,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:20:32,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:20:32,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,650 INFO L137 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 115 [2021-11-21 00:20:32,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:20:32,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:20:32,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:20:32,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:20:32,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:20:32,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:20:32,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:20:32,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:20:32,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (1/1) ... [2021-11-21 00:20:32,732 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:20:32,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:32,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:20:32,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:20:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 00:20:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 00:20:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 00:20:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-21 00:20:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-21 00:20:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:20:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-21 00:20:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-21 00:20:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:20:32,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:20:32,816 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-21 00:20:33,012 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:20:33,014 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:20:33,291 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:20:33,300 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:20:33,300 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-21 00:20:33,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:20:33 BoogieIcfgContainer [2021-11-21 00:20:33,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:20:33,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:20:33,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:20:33,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:20:33,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:20:31" (1/3) ... [2021-11-21 00:20:33,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1066dd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:20:33, skipping insertion in model container [2021-11-21 00:20:33,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:20:32" (2/3) ... [2021-11-21 00:20:33,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1066dd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:20:33, skipping insertion in model container [2021-11-21 00:20:33,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:20:33" (3/3) ... [2021-11-21 00:20:33,322 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2021-11-21 00:20:33,327 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-21 00:20:33,327 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:20:33,328 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-11-21 00:20:33,328 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-21 00:20:33,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,359 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,360 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,361 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,362 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,363 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,364 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,365 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-21 00:20:33,365 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-21 00:20:33,365 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,365 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-21 00:20:33,365 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-21 00:20:33,366 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-21 00:20:33,366 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-21 00:20:33,366 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-21 00:20:33,366 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-21 00:20:33,367 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-21 00:20:33,367 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-21 00:20:33,367 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-21 00:20:33,367 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-21 00:20:33,368 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-21 00:20:33,368 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-21 00:20:33,368 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-21 00:20:33,368 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-21 00:20:33,368 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-21 00:20:33,369 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-21 00:20:33,369 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-21 00:20:33,369 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-21 00:20:33,369 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-21 00:20:33,369 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-21 00:20:33,370 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-21 00:20:33,370 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-21 00:20:33,370 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-21 00:20:33,386 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-21 00:20:33,387 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-21 00:20:33,387 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-21 00:20:33,387 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-21 00:20:33,387 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-21 00:20:33,388 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-21 00:20:33,388 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-21 00:20:33,388 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-21 00:20:33,388 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-21 00:20:33,388 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-21 00:20:33,389 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-21 00:20:33,389 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-21 00:20:33,389 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-21 00:20:33,389 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-21 00:20:33,390 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-21 00:20:33,390 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-21 00:20:33,390 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-21 00:20:33,390 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-21 00:20:33,391 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-21 00:20:33,391 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-21 00:20:33,391 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-21 00:20:33,391 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-21 00:20:33,391 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-21 00:20:33,392 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-21 00:20:33,392 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-21 00:20:33,392 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-21 00:20:33,392 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-21 00:20:33,393 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-21 00:20:33,393 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-21 00:20:33,393 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-21 00:20:33,393 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-21 00:20:33,394 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-21 00:20:33,394 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-21 00:20:33,394 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-21 00:20:33,394 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-21 00:20:33,396 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-21 00:20:33,396 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-21 00:20:33,396 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-21 00:20:33,396 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-21 00:20:33,397 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-21 00:20:33,397 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-21 00:20:33,397 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-21 00:20:33,397 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-21 00:20:33,398 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-21 00:20:33,398 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-21 00:20:33,398 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-21 00:20:33,399 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-21 00:20:33,399 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-21 00:20:33,399 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-21 00:20:33,399 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-21 00:20:33,400 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-21 00:20:33,400 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-21 00:20:33,400 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-21 00:20:33,400 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-21 00:20:33,400 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-21 00:20:33,401 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-21 00:20:33,401 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-21 00:20:33,401 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-21 00:20:33,401 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-21 00:20:33,402 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-21 00:20:33,402 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-21 00:20:33,402 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-21 00:20:33,402 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-21 00:20:33,403 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-21 00:20:33,403 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-21 00:20:33,403 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-21 00:20:33,403 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-21 00:20:33,404 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-21 00:20:33,404 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-21 00:20:33,404 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-21 00:20:33,404 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-21 00:20:33,414 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-21 00:20:33,414 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-21 00:20:33,415 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-21 00:20:33,415 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-21 00:20:33,415 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-21 00:20:33,415 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-21 00:20:33,416 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-21 00:20:33,416 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-21 00:20:33,416 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-21 00:20:33,416 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-21 00:20:33,416 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-21 00:20:33,417 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-21 00:20:33,417 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-21 00:20:33,417 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-21 00:20:33,417 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-21 00:20:33,418 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-21 00:20:33,418 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-21 00:20:33,418 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-21 00:20:33,418 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-21 00:20:33,419 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-21 00:20:33,419 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-21 00:20:33,419 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-21 00:20:33,419 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-21 00:20:33,419 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-21 00:20:33,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,439 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-21 00:20:33,439 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-21 00:20:33,440 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-21 00:20:33,440 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-21 00:20:33,440 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-21 00:20:33,440 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-21 00:20:33,440 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-21 00:20:33,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-21 00:20:33,441 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-21 00:20:33,460 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-21 00:20:33,504 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:20:33,511 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-21 00:20:33,526 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2021-11-21 00:20:33,542 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-21 00:20:33,554 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-21 00:20:33,557 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 261 flow [2021-11-21 00:20:33,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 261 flow [2021-11-21 00:20:33,631 INFO L129 PetriNetUnfolder]: 6/127 cut-off events. [2021-11-21 00:20:33,633 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-21 00:20:33,641 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-21 00:20:33,647 INFO L116 LiptonReduction]: Number of co-enabled transitions 4864 [2021-11-21 00:20:36,124 INFO L131 LiptonReduction]: Checked pairs total: 16173 [2021-11-21 00:20:36,126 INFO L133 LiptonReduction]: Total number of compositions: 75 [2021-11-21 00:20:36,147 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 56 transitions, 117 flow [2021-11-21 00:20:36,203 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-21 00:20:36,207 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-21 00:20:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-21 00:20:36,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:36,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:20:36,217 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-21 00:20:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2114734191, now seen corresponding path program 1 times [2021-11-21 00:20:36,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:36,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779971824] [2021-11-21 00:20:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:36,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:36,404 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-21 00:20:36,405 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:36,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779971824] [2021-11-21 00:20:36,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779971824] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:36,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:20:36,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:20:36,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308342605] [2021-11-21 00:20:36,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:36,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:20:36,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:36,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:20:36,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:20:36,437 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-21 00:20:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:36,522 INFO L93 Difference]: Finished difference Result 596 states and 1189 transitions. [2021-11-21 00:20:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:20:36,524 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-21 00:20:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:36,543 INFO L225 Difference]: With dead ends: 596 [2021-11-21 00:20:36,544 INFO L226 Difference]: Without dead ends: 596 [2021-11-21 00:20:36,545 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-21 00:20:36,548 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-21 00:20:36,549 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-21 00:20:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-21 00:20:36,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-11-21 00:20:36,624 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-21 00:20:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1189 transitions. [2021-11-21 00:20:36,628 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1189 transitions. Word has length 11 [2021-11-21 00:20:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:36,629 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 1189 transitions. [2021-11-21 00:20:36,629 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-21 00:20:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1189 transitions. [2021-11-21 00:20:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-21 00:20:36,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:36,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:20:36,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:20:36,632 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-21 00:20:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:36,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1783178182, now seen corresponding path program 1 times [2021-11-21 00:20:36,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:36,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994212826] [2021-11-21 00:20:36,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:36,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:36,692 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-21 00:20:36,692 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:36,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994212826] [2021-11-21 00:20:36,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994212826] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395141788] [2021-11-21 00:20:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:36,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:36,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:36,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 00:20:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:36,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:20:36,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:36,892 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-21 00:20:36,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:20:36,985 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-21 00:20:36,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395141788] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:20:36,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882843438] [2021-11-21 00:20:36,993 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-21 00:20:36,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:20:36,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-21 00:20:36,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062610167] [2021-11-21 00:20:36,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:20:36,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 00:20:36,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 00:20:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:20:36,998 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-21 00:20:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:37,116 INFO L93 Difference]: Finished difference Result 599 states and 1192 transitions. [2021-11-21 00:20:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:37,117 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-21 00:20:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:37,123 INFO L225 Difference]: With dead ends: 599 [2021-11-21 00:20:37,129 INFO L226 Difference]: Without dead ends: 599 [2021-11-21 00:20:37,130 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-21 00:20:37,131 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-21 00:20:37,132 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-21 00:20:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-21 00:20:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-21 00:20:37,179 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-21 00:20:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1192 transitions. [2021-11-21 00:20:37,186 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1192 transitions. Word has length 12 [2021-11-21 00:20:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:37,187 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 1192 transitions. [2021-11-21 00:20:37,187 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-21 00:20:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1192 transitions. [2021-11-21 00:20:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 00:20:37,189 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:37,189 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:20:37,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:20:37,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:37,403 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-21 00:20:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -336848431, now seen corresponding path program 2 times [2021-11-21 00:20:37,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:37,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520403321] [2021-11-21 00:20:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:37,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:37,579 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-21 00:20:37,579 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:37,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520403321] [2021-11-21 00:20:37,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520403321] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:37,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077036745] [2021-11-21 00:20:37,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:20:37,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:37,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:37,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:37,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 00:20:37,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 00:20:37,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:20:37,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 00:20:37,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:37,720 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-21 00:20:37,770 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-21 00:20:37,770 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-21 00:20:37,830 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-21 00:20:37,830 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-21 00:20:37,893 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-21 00:20:37,895 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-21 00:20:37,926 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-21 00:20:37,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 00:20:37,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077036745] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:37,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 00:20:37,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2021-11-21 00:20:37,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144099213] [2021-11-21 00:20:37,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:37,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:20:37,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:37,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:20:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-21 00:20:37,934 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-21 00:20:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:38,574 INFO L93 Difference]: Finished difference Result 790 states and 1574 transitions. [2021-11-21 00:20:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:38,575 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-21 00:20:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:38,580 INFO L225 Difference]: With dead ends: 790 [2021-11-21 00:20:38,581 INFO L226 Difference]: Without dead ends: 790 [2021-11-21 00:20:38,581 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-21 00:20:38,583 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:20:38,583 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.6s Time] [2021-11-21 00:20:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-11-21 00:20:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 726. [2021-11-21 00:20:38,607 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-21 00:20:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1446 transitions. [2021-11-21 00:20:38,611 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1446 transitions. Word has length 15 [2021-11-21 00:20:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:38,612 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 1446 transitions. [2021-11-21 00:20:38,612 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-21 00:20:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1446 transitions. [2021-11-21 00:20:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 00:20:38,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:38,614 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:20:38,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:20:38,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:38,827 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-21 00:20:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:38,827 INFO L85 PathProgramCache]: Analyzing trace with hash 202679984, now seen corresponding path program 1 times [2021-11-21 00:20:38,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:38,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629939325] [2021-11-21 00:20:38,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:38,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:38,933 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-21 00:20:38,933 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629939325] [2021-11-21 00:20:38,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629939325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:38,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:20:38,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:20:38,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894679268] [2021-11-21 00:20:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:38,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 00:20:38,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 00:20:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 00:20:38,936 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-21 00:20:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:38,999 INFO L93 Difference]: Finished difference Result 1028 states and 2050 transitions. [2021-11-21 00:20:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 00:20:38,999 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-21 00:20:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:39,007 INFO L225 Difference]: With dead ends: 1028 [2021-11-21 00:20:39,007 INFO L226 Difference]: Without dead ends: 1028 [2021-11-21 00:20:39,008 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-21 00:20:39,009 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.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:20:39,010 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.1s Time] [2021-11-21 00:20:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-21 00:20:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 743. [2021-11-21 00:20:39,036 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-21 00:20:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1480 transitions. [2021-11-21 00:20:39,040 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1480 transitions. Word has length 15 [2021-11-21 00:20:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:39,041 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1480 transitions. [2021-11-21 00:20:39,041 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-21 00:20:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1480 transitions. [2021-11-21 00:20:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 00:20:39,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:39,042 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:20:39,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 00:20:39,042 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-21 00:20:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2013723712, now seen corresponding path program 1 times [2021-11-21 00:20:39,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:39,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865708630] [2021-11-21 00:20:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:39,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:39,116 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-21 00:20:39,116 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:39,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865708630] [2021-11-21 00:20:39,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865708630] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:39,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350029851] [2021-11-21 00:20:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:39,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:39,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:39,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:39,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 00:20:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:39,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:20:39,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:39,248 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-21 00:20:39,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:20:39,344 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-21 00:20:39,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350029851] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:20:39,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [97607264] [2021-11-21 00:20:39,344 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-21 00:20:39,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:20:39,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-21 00:20:39,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177116683] [2021-11-21 00:20:39,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:20:39,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 00:20:39,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:39,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 00:20:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-21 00:20:39,347 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-21 00:20:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:39,451 INFO L93 Difference]: Finished difference Result 749 states and 1486 transitions. [2021-11-21 00:20:39,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 00:20:39,452 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-21 00:20:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:39,457 INFO L225 Difference]: With dead ends: 749 [2021-11-21 00:20:39,458 INFO L226 Difference]: Without dead ends: 749 [2021-11-21 00:20:39,458 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-21 00:20:39,459 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-21 00:20:39,459 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-21 00:20:39,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2021-11-21 00:20:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2021-11-21 00:20:39,481 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-21 00:20:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1486 transitions. [2021-11-21 00:20:39,486 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1486 transitions. Word has length 15 [2021-11-21 00:20:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:39,486 INFO L470 AbstractCegarLoop]: Abstraction has 749 states and 1486 transitions. [2021-11-21 00:20:39,486 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-21 00:20:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1486 transitions. [2021-11-21 00:20:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-21 00:20:39,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:39,488 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:20:39,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-21 00:20:39,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:39,706 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-21 00:20:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -805061856, now seen corresponding path program 2 times [2021-11-21 00:20:39,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:39,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051546484] [2021-11-21 00:20:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:39,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:39,912 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-21 00:20:39,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:39,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051546484] [2021-11-21 00:20:39,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051546484] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:39,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:20:39,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:20:39,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110943290] [2021-11-21 00:20:39,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:39,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:20:39,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:39,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:20:39,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:20:39,916 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-21 00:20:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:40,340 INFO L93 Difference]: Finished difference Result 839 states and 1666 transitions. [2021-11-21 00:20:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:40,341 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-21 00:20:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:40,347 INFO L225 Difference]: With dead ends: 839 [2021-11-21 00:20:40,347 INFO L226 Difference]: Without dead ends: 839 [2021-11-21 00:20:40,347 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-21 00:20:40,362 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.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:20:40,362 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.4s Time] [2021-11-21 00:20:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-11-21 00:20:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 807. [2021-11-21 00:20:40,386 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-21 00:20:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1602 transitions. [2021-11-21 00:20:40,391 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1602 transitions. Word has length 21 [2021-11-21 00:20:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:40,391 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 1602 transitions. [2021-11-21 00:20:40,391 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-21 00:20:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1602 transitions. [2021-11-21 00:20:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:20:40,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:40,393 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-21 00:20:40,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-21 00:20:40,394 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-21 00:20:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2074507123, now seen corresponding path program 1 times [2021-11-21 00:20:40,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:40,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411279716] [2021-11-21 00:20:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:40,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:40,534 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-21 00:20:40,534 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:40,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411279716] [2021-11-21 00:20:40,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411279716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:40,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:20:40,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:20:40,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804074178] [2021-11-21 00:20:40,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:40,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:20:40,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:20:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:20:40,536 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-21 00:20:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:41,190 INFO L93 Difference]: Finished difference Result 967 states and 1922 transitions. [2021-11-21 00:20:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:41,190 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-21 00:20:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:41,197 INFO L225 Difference]: With dead ends: 967 [2021-11-21 00:20:41,197 INFO L226 Difference]: Without dead ends: 935 [2021-11-21 00:20:41,197 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-21 00:20:41,198 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.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:20:41,198 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.6s Time] [2021-11-21 00:20:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2021-11-21 00:20:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 902. [2021-11-21 00:20:41,222 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-21 00:20:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1788 transitions. [2021-11-21 00:20:41,226 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1788 transitions. Word has length 27 [2021-11-21 00:20:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:41,227 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1788 transitions. [2021-11-21 00:20:41,227 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-21 00:20:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1788 transitions. [2021-11-21 00:20:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-21 00:20:41,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:41,228 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-21 00:20:41,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-21 00:20:41,229 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-21 00:20:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash -444468531, now seen corresponding path program 1 times [2021-11-21 00:20:41,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:41,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992807888] [2021-11-21 00:20:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:41,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:41,339 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-21 00:20:41,340 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:41,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992807888] [2021-11-21 00:20:41,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992807888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:41,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:20:41,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 00:20:41,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067281351] [2021-11-21 00:20:41,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:41,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:20:41,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:41,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:20:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:20:41,342 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-21 00:20:41,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:41,659 INFO L93 Difference]: Finished difference Result 967 states and 1918 transitions. [2021-11-21 00:20:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:41,659 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-21 00:20:41,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:41,665 INFO L225 Difference]: With dead ends: 967 [2021-11-21 00:20:41,666 INFO L226 Difference]: Without dead ends: 967 [2021-11-21 00:20:41,666 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-21 00:20:41,668 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-21 00:20:41,668 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-21 00:20:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2021-11-21 00:20:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2021-11-21 00:20:41,693 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-21 00:20:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1918 transitions. [2021-11-21 00:20:41,696 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1918 transitions. Word has length 27 [2021-11-21 00:20:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:41,697 INFO L470 AbstractCegarLoop]: Abstraction has 967 states and 1918 transitions. [2021-11-21 00:20:41,697 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-21 00:20:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1918 transitions. [2021-11-21 00:20:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 00:20:41,698 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:41,699 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-21 00:20:41,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-21 00:20:41,699 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-21 00:20:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1511693174, now seen corresponding path program 1 times [2021-11-21 00:20:41,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614246048] [2021-11-21 00:20:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:41,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:41,907 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-21 00:20:41,907 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614246048] [2021-11-21 00:20:41,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614246048] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813879954] [2021-11-21 00:20:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:41,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:41,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:41,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-21 00:20:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:41,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 00:20:41,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:42,081 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-21 00:20:42,144 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-21 00:20:42,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 00:20:42,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813879954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:42,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 00:20:42,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-21 00:20:42,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048145361] [2021-11-21 00:20:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:42,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:20:42,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:42,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:20:42,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-21 00:20:42,147 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-21 00:20:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:42,324 INFO L93 Difference]: Finished difference Result 2184 states and 4322 transitions. [2021-11-21 00:20:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:42,325 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-21 00:20:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:42,343 INFO L225 Difference]: With dead ends: 2184 [2021-11-21 00:20:42,343 INFO L226 Difference]: Without dead ends: 2184 [2021-11-21 00:20:42,344 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-21 00:20:42,345 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-21 00:20:42,346 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-21 00:20:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2021-11-21 00:20:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1024. [2021-11-21 00:20:42,386 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-21 00:20:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2006 transitions. [2021-11-21 00:20:42,392 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2006 transitions. Word has length 31 [2021-11-21 00:20:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:42,392 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 2006 transitions. [2021-11-21 00:20:42,393 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-21 00:20:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2006 transitions. [2021-11-21 00:20:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 00:20:42,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:42,396 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-21 00:20:42,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-21 00:20:42,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-21 00:20:42,621 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-21 00:20:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:42,622 INFO L85 PathProgramCache]: Analyzing trace with hash -782408396, now seen corresponding path program 2 times [2021-11-21 00:20:42,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:42,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197969475] [2021-11-21 00:20:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:42,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:42,776 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-21 00:20:42,776 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:42,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197969475] [2021-11-21 00:20:42,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197969475] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:42,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842876963] [2021-11-21 00:20:42,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:20:42,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:42,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:42,783 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:42,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-21 00:20:42,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 00:20:42,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:20:42,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 00:20:42,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:42,910 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-21 00:20:42,998 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-21 00:20:42,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 00:20:42,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842876963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:42,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 00:20:42,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-21 00:20:42,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763123084] [2021-11-21 00:20:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:43,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:20:43,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:43,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:20:43,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-11-21 00:20:43,002 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-21 00:20:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:43,209 INFO L93 Difference]: Finished difference Result 2484 states and 4895 transitions. [2021-11-21 00:20:43,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:43,210 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-21 00:20:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:43,230 INFO L225 Difference]: With dead ends: 2484 [2021-11-21 00:20:43,230 INFO L226 Difference]: Without dead ends: 2484 [2021-11-21 00:20:43,230 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-21 00:20:43,231 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.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:20:43,233 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.2s Time] [2021-11-21 00:20:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2021-11-21 00:20:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1037. [2021-11-21 00:20:43,290 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-21 00:20:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 2032 transitions. [2021-11-21 00:20:43,298 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 2032 transitions. Word has length 31 [2021-11-21 00:20:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:43,299 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 2032 transitions. [2021-11-21 00:20:43,299 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-21 00:20:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 2032 transitions. [2021-11-21 00:20:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-21 00:20:43,301 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:43,302 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-21 00:20:43,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-21 00:20:43,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:43,526 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-21 00:20:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1917489978, now seen corresponding path program 3 times [2021-11-21 00:20:43,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:43,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613670413] [2021-11-21 00:20:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:43,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:43,660 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-21 00:20:43,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:43,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613670413] [2021-11-21 00:20:43,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613670413] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:43,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190911597] [2021-11-21 00:20:43,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 00:20:43,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:43,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:43,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:43,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-21 00:20:43,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 00:20:43,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:20:43,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-21 00:20:43,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:43,848 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-21 00:20:43,903 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-21 00:20:43,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 00:20:43,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190911597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:20:43,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 00:20:43,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2021-11-21 00:20:43,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418662940] [2021-11-21 00:20:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:20:43,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:20:43,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:43,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:20:43,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-21 00:20:43,906 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-21 00:20:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:44,073 INFO L93 Difference]: Finished difference Result 1904 states and 3740 transitions. [2021-11-21 00:20:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 00:20:44,074 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-21 00:20:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:44,087 INFO L225 Difference]: With dead ends: 1904 [2021-11-21 00:20:44,087 INFO L226 Difference]: Without dead ends: 1904 [2021-11-21 00:20:44,088 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-21 00:20:44,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-21 00:20:44,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-21 00:20:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-11-21 00:20:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1049. [2021-11-21 00:20:44,125 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-21 00:20:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2056 transitions. [2021-11-21 00:20:44,130 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2056 transitions. Word has length 31 [2021-11-21 00:20:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:44,130 INFO L470 AbstractCegarLoop]: Abstraction has 1049 states and 2056 transitions. [2021-11-21 00:20:44,130 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-21 00:20:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2056 transitions. [2021-11-21 00:20:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-21 00:20:44,131 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:44,132 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-21 00:20:44,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-21 00:20:44,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:44,359 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-21 00:20:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash -643420328, now seen corresponding path program 1 times [2021-11-21 00:20:44,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:44,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266723169] [2021-11-21 00:20:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:44,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:44,417 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-21 00:20:44,418 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266723169] [2021-11-21 00:20:44,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266723169] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730425734] [2021-11-21 00:20:44,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:44,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:44,420 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:44,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-21 00:20:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:44,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:20:44,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:44,570 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-21 00:20:44,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:20:44,659 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-21 00:20:44,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730425734] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:20:44,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1564276697] [2021-11-21 00:20:44,660 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-21 00:20:44,661 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:20:44,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-21 00:20:44,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634198737] [2021-11-21 00:20:44,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:20:44,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 00:20:44,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:44,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 00:20:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:20:44,664 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-21 00:20:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:44,791 INFO L93 Difference]: Finished difference Result 2629 states and 5216 transitions. [2021-11-21 00:20:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:20:44,792 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-21 00:20:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:44,810 INFO L225 Difference]: With dead ends: 2629 [2021-11-21 00:20:44,810 INFO L226 Difference]: Without dead ends: 2629 [2021-11-21 00:20:44,810 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-21 00:20:44,811 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-21 00:20:44,811 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-21 00:20:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2021-11-21 00:20:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2494. [2021-11-21 00:20:44,886 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-21 00:20:44,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 2494 states and 5081 transitions. [2021-11-21 00:20:44,896 INFO L78 Accepts]: Start accepts. Automaton has 2494 states and 5081 transitions. Word has length 35 [2021-11-21 00:20:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:44,897 INFO L470 AbstractCegarLoop]: Abstraction has 2494 states and 5081 transitions. [2021-11-21 00:20:44,897 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-21 00:20:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2494 states and 5081 transitions. [2021-11-21 00:20:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:20:44,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:44,899 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-21 00:20:44,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-21 00:20:45,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-21 00:20:45,127 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-21 00:20:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -329216545, now seen corresponding path program 1 times [2021-11-21 00:20:45,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:45,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525150319] [2021-11-21 00:20:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:45,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:45,519 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-21 00:20:45,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525150319] [2021-11-21 00:20:45,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525150319] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160741160] [2021-11-21 00:20:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:45,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:45,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:45,523 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:45,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-21 00:20:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:45,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-21 00:20:45,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:46,106 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-21 00:20:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,173 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-21 00:20:46,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,244 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-21 00:20:46,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,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-21 00:20:46,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:20:46,502 INFO L354 Elim1Store]: treesize reduction 122, result has 22.3 percent of original size [2021-11-21 00:20:46,503 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-21 00:20:46,618 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-21 00:20:46,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:20:46,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:46,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:20:47,520 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-21 00:20:47,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160741160] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:20:47,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [480179900] [2021-11-21 00:20:47,521 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-21 00:20:47,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:20:47,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 00:20:47,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888129262] [2021-11-21 00:20:47,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:20:47,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 00:20:47,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:47,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 00:20:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2021-11-21 00:20:47,524 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-21 00:20:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:20:52,660 INFO L93 Difference]: Finished difference Result 10550 states and 21429 transitions. [2021-11-21 00:20:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-21 00:20:52,660 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-21 00:20:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:20:52,718 INFO L225 Difference]: With dead ends: 10550 [2021-11-21 00:20:52,719 INFO L226 Difference]: Without dead ends: 10550 [2021-11-21 00:20:52,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=595, Invalid=2267, Unknown=0, NotChecked=0, Total=2862 [2021-11-21 00:20:52,721 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 872 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 2936 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:20:52,721 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.3s Time] [2021-11-21 00:20:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10550 states. [2021-11-21 00:20:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10550 to 6001. [2021-11-21 00:20:53,011 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-21 00:20:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 12863 transitions. [2021-11-21 00:20:53,033 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 12863 transitions. Word has length 45 [2021-11-21 00:20:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:20:53,034 INFO L470 AbstractCegarLoop]: Abstraction has 6001 states and 12863 transitions. [2021-11-21 00:20:53,034 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-21 00:20:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 12863 transitions. [2021-11-21 00:20:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:20:53,037 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:20:53,037 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-21 00:20:53,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-21 00:20:53,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:53,251 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-21 00:20:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:20:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1700766169, now seen corresponding path program 1 times [2021-11-21 00:20:53,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:20:53,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851804806] [2021-11-21 00:20:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:53,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:20:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:53,450 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-21 00:20:53,450 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:20:53,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851804806] [2021-11-21 00:20:53,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851804806] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:20:53,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66658110] [2021-11-21 00:20:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:53,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:20:53,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:20:53,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:20:53,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-21 00:20:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:53,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 00:20:53,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:53,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, 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-21 00:20:53,953 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-21 00:20:53,953 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-21 00:20:53,991 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-21 00:20:53,992 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-21 00:20:54,043 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-21 00:20:54,043 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-21 00:20:54,111 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-21 00:20:54,111 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-21 00:20:54,151 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-21 00:20:54,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:20:54,264 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 00:20:54,264 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-21 00:20:54,266 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-21 00:20:54,269 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-21 00:20:54,527 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-21 00:20:54,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66658110] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:20:54,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2041986019] [2021-11-21 00:20:54,528 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-21 00:20:54,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:20:54,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-21 00:20:54,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575427647] [2021-11-21 00:20:54,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:20:54,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-21 00:20:54,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:20:54,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-21 00:20:54,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-11-21 00:20:54,531 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-21 00:21:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:21:01,573 INFO L93 Difference]: Finished difference Result 12679 states and 25789 transitions. [2021-11-21 00:21:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-11-21 00:21:01,573 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-21 00:21:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:21:01,617 INFO L225 Difference]: With dead ends: 12679 [2021-11-21 00:21:01,617 INFO L226 Difference]: Without dead ends: 12679 [2021-11-21 00:21:01,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2220, Invalid=9336, Unknown=0, NotChecked=0, Total=11556 [2021-11-21 00:21:01,622 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 1333 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 6625 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:21:01,622 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.2s Time] [2021-11-21 00:21:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2021-11-21 00:21:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 6071. [2021-11-21 00:21:01,861 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-21 00:21:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6071 states to 6071 states and 13003 transitions. [2021-11-21 00:21:01,896 INFO L78 Accepts]: Start accepts. Automaton has 6071 states and 13003 transitions. Word has length 45 [2021-11-21 00:21:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:21:01,897 INFO L470 AbstractCegarLoop]: Abstraction has 6071 states and 13003 transitions. [2021-11-21 00:21:01,898 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-21 00:21:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6071 states and 13003 transitions. [2021-11-21 00:21:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:21:01,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:21:01,901 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-21 00:21:01,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-21 00:21:02,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:21:02,118 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-21 00:21:02,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:21:02,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1883138674, now seen corresponding path program 1 times [2021-11-21 00:21:02,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:21:02,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809618473] [2021-11-21 00:21:02,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:21:02,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:21:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:21:02,921 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-21 00:21:02,921 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:21:02,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809618473] [2021-11-21 00:21:02,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809618473] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:21:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844079761] [2021-11-21 00:21:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:21:02,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:21:02,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:21:02,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:21:02,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-21 00:21:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:21:03,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-21 00:21:03,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:21:03,437 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-21 00:21:03,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,489 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-21 00:21:03,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,560 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-21 00:21:03,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,666 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-21 00:21:03,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,750 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-21 00:21:03,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,870 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-21 00:21:03,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:03,976 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-21 00:21:04,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,100 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-21 00:21:04,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:04,387 INFO L354 Elim1Store]: treesize reduction 615, result has 10.7 percent of original size [2021-11-21 00:21:04,388 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-21 00:21:16,530 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-21 00:21:16,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:21:18,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:18,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:19,443 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-21 00:21:19,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844079761] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:21:19,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648701626] [2021-11-21 00:21:19,444 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-21 00:21:19,445 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:21:19,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-21 00:21:19,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111007629] [2021-11-21 00:21:19,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:21:19,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-21 00:21:19,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:21:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-21 00:21:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1191, Unknown=5, NotChecked=0, Total=1482 [2021-11-21 00:21:19,447 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-21 00:21:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:21:51,000 INFO L93 Difference]: Finished difference Result 12223 states and 24898 transitions. [2021-11-21 00:21:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-21 00:21:51,001 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-21 00:21:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:21:51,037 INFO L225 Difference]: With dead ends: 12223 [2021-11-21 00:21:51,037 INFO L226 Difference]: Without dead ends: 12223 [2021-11-21 00:21:51,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 72 SyntacticMatches, 12 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2000 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=1207, Invalid=4478, Unknown=15, NotChecked=0, Total=5700 [2021-11-21 00:21:51,040 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-21 00:21:51,040 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-21 00:21:51,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12223 states. [2021-11-21 00:21:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12223 to 6268. [2021-11-21 00:21:51,259 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-21 00:21:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 13409 transitions. [2021-11-21 00:21:51,274 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 13409 transitions. Word has length 45 [2021-11-21 00:21:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:21:51,275 INFO L470 AbstractCegarLoop]: Abstraction has 6268 states and 13409 transitions. [2021-11-21 00:21:51,275 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-21 00:21:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 13409 transitions. [2021-11-21 00:21:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:21:51,278 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:21:51,278 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-21 00:21:51,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-21 00:21:51,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-21 00:21:51,495 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-21 00:21:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:21:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2029288535, now seen corresponding path program 1 times [2021-11-21 00:21:51,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:21:51,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664886349] [2021-11-21 00:21:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:21:51,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:21:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:21:51,868 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-21 00:21:51,868 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:21:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664886349] [2021-11-21 00:21:51,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664886349] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:21:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224408090] [2021-11-21 00:21:51,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:21:51,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:21:51,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:21:51,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:21:51,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-21 00:21:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:21:51,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 00:21:51,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:21:52,310 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-21 00:21:52,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,349 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-21 00:21:52,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,398 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-21 00:21:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:21:52,470 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-21 00:21:52,584 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 00:21:52,584 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-21 00:21:52,656 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-21 00:21:52,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:21:52,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:52,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:21:53,365 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-21 00:21:53,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224408090] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:21:53,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1419404817] [2021-11-21 00:21:53,366 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-21 00:21:53,366 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:21:53,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 00:21:53,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801097446] [2021-11-21 00:21:53,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:21:53,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 00:21:53,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:21:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 00:21:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2021-11-21 00:21:53,369 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-21 00:22:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:22:02,454 INFO L93 Difference]: Finished difference Result 12441 states and 25326 transitions. [2021-11-21 00:22:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-21 00:22:02,455 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-21 00:22:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:22:02,494 INFO L225 Difference]: With dead ends: 12441 [2021-11-21 00:22:02,494 INFO L226 Difference]: Without dead ends: 12441 [2021-11-21 00:22:02,497 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-21 00:22:02,498 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 1191 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 5144 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s 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, 6.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:22:02,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 293 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 5144 Invalid, 0 Unknown, 82 Unchecked, 6.0s Time] [2021-11-21 00:22:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12441 states. [2021-11-21 00:22:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12441 to 6478. [2021-11-21 00:22:02,704 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-21 00:22:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 13845 transitions. [2021-11-21 00:22:02,722 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 13845 transitions. Word has length 45 [2021-11-21 00:22:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:22:02,722 INFO L470 AbstractCegarLoop]: Abstraction has 6478 states and 13845 transitions. [2021-11-21 00:22:02,722 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-21 00:22:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 13845 transitions. [2021-11-21 00:22:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:22:02,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:22:02,726 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-21 00:22:02,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-21 00:22:02,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-21 00:22:02,947 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-21 00:22:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:22:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash -873806249, now seen corresponding path program 2 times [2021-11-21 00:22:02,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:22:02,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307979946] [2021-11-21 00:22:02,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:22:02,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:22:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:22:03,276 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-21 00:22:03,276 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:22:03,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307979946] [2021-11-21 00:22:03,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307979946] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:22:03,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856046827] [2021-11-21 00:22:03,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:22:03,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:22:03,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:22:03,279 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:22:03,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-21 00:22:03,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 00:22:03,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:22:03,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-21 00:22:03,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:22:03,529 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-21 00:22:03,700 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-21 00:22:03,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,750 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-21 00:22:03,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,811 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-21 00:22:03,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:03,907 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-21 00:22:04,001 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-21 00:22:04,005 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-21 00:22:04,150 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-21 00:22:04,151 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-21 00:22:04,220 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-21 00:22:04,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:22:04,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:22:04,949 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-21 00:22:04,952 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-21 00:22:04,998 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-21 00:22:04,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856046827] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 00:22:04,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-21 00:22:04,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-21 00:22:04,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469098001] [2021-11-21 00:22:04,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:22:04,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 00:22:05,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:22:05,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 00:22:05,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=574, Unknown=1, NotChecked=0, Total=702 [2021-11-21 00:22:05,001 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-21 00:22:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:22:09,233 INFO L93 Difference]: Finished difference Result 8036 states and 17070 transitions. [2021-11-21 00:22:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-21 00:22:09,233 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-21 00:22:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:22:09,253 INFO L225 Difference]: With dead ends: 8036 [2021-11-21 00:22:09,253 INFO L226 Difference]: Without dead ends: 8036 [2021-11-21 00:22:09,254 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-21 00:22:09,255 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 127 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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, 3.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:22:09,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 43 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2021-11-21 00:22:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8036 states. [2021-11-21 00:22:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8036 to 6615. [2021-11-21 00:22:09,433 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-21 00:22:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 14143 transitions. [2021-11-21 00:22:09,452 INFO L78 Accepts]: Start accepts. Automaton has 6615 states and 14143 transitions. Word has length 45 [2021-11-21 00:22:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:22:09,452 INFO L470 AbstractCegarLoop]: Abstraction has 6615 states and 14143 transitions. [2021-11-21 00:22:09,452 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-21 00:22:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6615 states and 14143 transitions. [2021-11-21 00:22:09,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:22:09,455 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:22:09,456 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-21 00:22:09,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-21 00:22:09,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-21 00:22:09,674 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-21 00:22:09,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:22:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash -799626659, now seen corresponding path program 3 times [2021-11-21 00:22:09,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:22:09,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149904969] [2021-11-21 00:22:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:22:09,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:22:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:22:10,005 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-21 00:22:10,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:22:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149904969] [2021-11-21 00:22:10,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149904969] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:22:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602844822] [2021-11-21 00:22:10,006 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 00:22:10,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:22:10,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:22:10,007 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:22:10,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-21 00:22:10,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 00:22:10,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:22:10,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 00:22:10,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:22:10,494 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-21 00:22:10,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,554 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-21 00:22:10,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,623 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-21 00:22:10,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:22:10,770 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-21 00:22:10,879 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 00:22:10,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-21 00:22:11,012 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-21 00:22:11,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:22:39,308 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-21 00:22:39,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602844822] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:22:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323200714] [2021-11-21 00:22:39,309 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-21 00:22:39,310 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:22:39,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 00:22:39,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347520024] [2021-11-21 00:22:39,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:22:39,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 00:22:39,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:22:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 00:22:39,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=845, Unknown=12, NotChecked=0, Total=992 [2021-11-21 00:22:39,313 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-21 00:22:59,077 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .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 (= (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 .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= (select .cse0 .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (< (+ |c_~#cache~0.offset| (* 28 |c_ULTIMATE.start_main_~i~2#1|)) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246|))) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 00:23:21,595 WARN L227 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:23:22,654 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_ULTIMATE.start_main_~i~2#1| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_246| Int)) (or (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2)) (.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (let ((.cse0 (select (let ((.cse3 (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) .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 (= (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 .cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= (select .cse0 .cse1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| (select .cse0 .cse2))))) (< (+ |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-21 00:23:36,093 WARN L227 SmtUtils]: Spent 8.95s 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-21 00:24:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:24:16,972 INFO L93 Difference]: Finished difference Result 20222 states and 41547 transitions. [2021-11-21 00:24:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-21 00:24:16,973 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-21 00:24:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:24:17,005 INFO L225 Difference]: With dead ends: 20222 [2021-11-21 00:24:17,006 INFO L226 Difference]: Without dead ends: 20222 [2021-11-21 00:24:17,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3096 ImplicationChecksByTransitivity, 123.2s TimeCoverageRelationStatistics Valid=1335, Invalid=7740, Unknown=53, NotChecked=378, Total=9506 [2021-11-21 00:24:17,010 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 946 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 3944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1306 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:24:17,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [946 Valid, 509 Invalid, 3944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2457 Invalid, 0 Unknown, 1306 Unchecked, 2.5s Time] [2021-11-21 00:24:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20222 states. [2021-11-21 00:24:17,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20222 to 12067. [2021-11-21 00:24:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12067 states, 12054 states have (on average 2.1761241081798572) internal successors, (26231), 12066 states have internal predecessors, (26231), 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-21 00:24:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12067 states to 12067 states and 26231 transitions. [2021-11-21 00:24:17,520 INFO L78 Accepts]: Start accepts. Automaton has 12067 states and 26231 transitions. Word has length 45 [2021-11-21 00:24:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:24:17,520 INFO L470 AbstractCegarLoop]: Abstraction has 12067 states and 26231 transitions. [2021-11-21 00:24:17,520 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-21 00:24:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 12067 states and 26231 transitions. [2021-11-21 00:24:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:24:17,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:24:17,524 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-21 00:24:17,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-21 00:24:17,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-21 00:24:17,751 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-21 00:24:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:24:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1527646261, now seen corresponding path program 4 times [2021-11-21 00:24:17,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:24:17,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789223284] [2021-11-21 00:24:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:24:17,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:24:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:24:18,162 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-21 00:24:18,163 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:24:18,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789223284] [2021-11-21 00:24:18,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789223284] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:24:18,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864817327] [2021-11-21 00:24:18,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 00:24:18,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:24:18,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:24:18,179 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:24:18,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-21 00:24:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:24:18,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 00:24:18,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:24:18,855 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-21 00:24:18,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:18,906 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-21 00:24:19,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,040 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-21 00:24:19,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:24:19,106 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-21 00:24:19,268 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 00:24:19,268 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-21 00:24:19,359 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-21 00:24:19,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:24:49,874 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-21 00:24:49,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864817327] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:24:49,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [757385987] [2021-11-21 00:24:49,875 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-21 00:24:49,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:24:49,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 00:24:49,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185736516] [2021-11-21 00:24:49,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:24:49,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 00:24:49,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:24:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 00:24:49,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=850, Unknown=9, NotChecked=0, Total=992 [2021-11-21 00:24:49,878 INFO L87 Difference]: Start difference. First operand 12067 states and 26231 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-21 00:25:07,872 WARN L227 SmtUtils]: Spent 6.89s 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-21 00:25:32,089 WARN L227 SmtUtils]: Spent 9.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-21 00:25:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:25:33,183 INFO L93 Difference]: Finished difference Result 22692 states and 48568 transitions. [2021-11-21 00:25:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-21 00:25:33,184 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-21 00:25:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:25:33,221 INFO L225 Difference]: With dead ends: 22692 [2021-11-21 00:25:33,222 INFO L226 Difference]: Without dead ends: 22692 [2021-11-21 00:25:33,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 71.0s TimeCoverageRelationStatistics Valid=768, Invalid=2875, Unknown=17, NotChecked=0, Total=3660 [2021-11-21 00:25:33,224 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 721 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 3782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 787 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:25:33,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 391 Invalid, 3782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2813 Invalid, 0 Unknown, 787 Unchecked, 2.8s Time] [2021-11-21 00:25:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22692 states. [2021-11-21 00:25:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22692 to 18425. [2021-11-21 00:25:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18425 states, 18412 states have (on average 2.1941125353030633) internal successors, (40398), 18424 states have internal predecessors, (40398), 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-21 00:25:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18425 states to 18425 states and 40398 transitions. [2021-11-21 00:25:33,924 INFO L78 Accepts]: Start accepts. Automaton has 18425 states and 40398 transitions. Word has length 45 [2021-11-21 00:25:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:25:33,925 INFO L470 AbstractCegarLoop]: Abstraction has 18425 states and 40398 transitions. [2021-11-21 00:25:33,925 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-21 00:25:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 18425 states and 40398 transitions. [2021-11-21 00:25:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:25:33,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:25:33,931 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-21 00:25:33,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-21 00:25:34,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:25:34,145 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-21 00:25:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:25:34,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1517537279, now seen corresponding path program 5 times [2021-11-21 00:25:34,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:25:34,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170687772] [2021-11-21 00:25:34,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:25:34,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:25:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:25:34,523 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-21 00:25:34,523 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:25:34,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170687772] [2021-11-21 00:25:34,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170687772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:25:34,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781033129] [2021-11-21 00:25:34,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:25:34,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:25:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:25:34,525 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:25:34,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-21 00:25:34,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-21 00:25:34,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:25:34,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-21 00:25:34,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:25:34,724 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-21 00:25:34,866 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-21 00:25:34,919 INFO L354 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2021-11-21 00:25:34,920 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-21 00:25:34,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:34,964 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-21 00:25:35,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,018 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-21 00:25:35,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:35,082 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-21 00:25:35,300 INFO L354 Elim1Store]: treesize reduction 148, result has 19.1 percent of original size [2021-11-21 00:25:35,300 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-21 00:25:35,378 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-21 00:25:35,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:25:35,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:35,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:36,358 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-21 00:25:36,360 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-21 00:25:36,409 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-21 00:25:36,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781033129] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-21 00:25:36,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-21 00:25:36,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 26 [2021-11-21 00:25:36,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102224162] [2021-11-21 00:25:36,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:25:36,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-21 00:25:36,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:25:36,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-21 00:25:36,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-11-21 00:25:36,412 INFO L87 Difference]: Start difference. First operand 18425 states and 40398 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-21 00:25:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:25:41,187 INFO L93 Difference]: Finished difference Result 21499 states and 46896 transitions. [2021-11-21 00:25:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 00:25:41,188 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-21 00:25:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:25:41,224 INFO L225 Difference]: With dead ends: 21499 [2021-11-21 00:25:41,224 INFO L226 Difference]: Without dead ends: 21499 [2021-11-21 00:25:41,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2021-11-21 00:25:41,226 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:25:41,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 33 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-21 00:25:41,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21499 states. [2021-11-21 00:25:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21499 to 18579. [2021-11-21 00:25:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18579 states, 18566 states have (on average 2.192502423785414) internal successors, (40706), 18578 states have internal predecessors, (40706), 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-21 00:25:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18579 states to 18579 states and 40706 transitions. [2021-11-21 00:25:41,877 INFO L78 Accepts]: Start accepts. Automaton has 18579 states and 40706 transitions. Word has length 45 [2021-11-21 00:25:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:25:41,877 INFO L470 AbstractCegarLoop]: Abstraction has 18579 states and 40706 transitions. [2021-11-21 00:25:41,877 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-21 00:25:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 18579 states and 40706 transitions. [2021-11-21 00:25:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:25:41,884 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:25:41,884 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-21 00:25:41,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-21 00:25:42,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:25:42,099 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-21 00:25:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:25:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1517924159, now seen corresponding path program 6 times [2021-11-21 00:25:42,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:25:42,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948576082] [2021-11-21 00:25:42,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:25:42,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:25:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:25:42,413 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-21 00:25:42,413 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:25:42,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948576082] [2021-11-21 00:25:42,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948576082] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:25:42,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450462947] [2021-11-21 00:25:42,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 00:25:42,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:25:42,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:25:42,415 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:25:42,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-21 00:25:42,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 00:25:42,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:25:42,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-21 00:25:42,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:25:43,246 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-21 00:25:43,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,339 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-21 00:25:43,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,399 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-21 00:25:43,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,599 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-21 00:25:43,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:43,705 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-21 00:25:43,771 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-21 00:25:43,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:25:44,173 INFO L354 Elim1Store]: treesize reduction 222, result has 16.2 percent of original size [2021-11-21 00:25:44,174 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-21 00:25:44,176 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-21 00:25:44,181 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-11-21 00:25:44,181 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-21 00:25:44,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,240 INFO L354 Elim1Store]: treesize reduction 109, result has 28.3 percent of original size [2021-11-21 00:25:44,240 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-21 00:25:44,244 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-21 00:25:44,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,251 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-21 00:25:44,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,307 INFO L354 Elim1Store]: treesize reduction 107, result has 29.6 percent of original size [2021-11-21 00:25:44,308 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-21 00:25:44,319 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:25:44,319 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-21 00:25:44,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:44,338 INFO L354 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2021-11-21 00:25:44,338 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-21 00:25:44,695 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-21 00:25:44,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450462947] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:25:44,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [659438108] [2021-11-21 00:25:44,695 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-21 00:25:44,696 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:25:44,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2021-11-21 00:25:44,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925233997] [2021-11-21 00:25:44,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:25:44,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-21 00:25:44,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:25:44,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-21 00:25:44,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2021-11-21 00:25:44,698 INFO L87 Difference]: Start difference. First operand 18579 states and 40706 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-21 00:25:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:25:53,900 INFO L93 Difference]: Finished difference Result 23668 states and 50720 transitions. [2021-11-21 00:25:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-21 00:25:53,901 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-21 00:25:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:25:53,937 INFO L225 Difference]: With dead ends: 23668 [2021-11-21 00:25:53,937 INFO L226 Difference]: Without dead ends: 23668 [2021-11-21 00:25:53,939 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-21 00:25:53,940 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 712 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 4676 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 4853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 4676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-11-21 00:25:53,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 442 Invalid, 4853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 4676 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2021-11-21 00:25:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23668 states. [2021-11-21 00:25:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23668 to 18616. [2021-11-21 00:25:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18616 states, 18603 states have (on average 2.1922270601515885) internal successors, (40782), 18615 states have internal predecessors, (40782), 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-21 00:25:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 40782 transitions. [2021-11-21 00:25:54,406 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 40782 transitions. Word has length 45 [2021-11-21 00:25:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:25:54,407 INFO L470 AbstractCegarLoop]: Abstraction has 18616 states and 40782 transitions. [2021-11-21 00:25:54,407 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-21 00:25:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 40782 transitions. [2021-11-21 00:25:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:25:54,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:25:54,411 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-21 00:25:54,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-21 00:25:54,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:25:54,639 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-21 00:25:54,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:25:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1069772857, now seen corresponding path program 2 times [2021-11-21 00:25:54,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:25:54,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358252572] [2021-11-21 00:25:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:25:54,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:25:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:25:54,990 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-21 00:25:54,990 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:25:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358252572] [2021-11-21 00:25:54,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358252572] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:25:54,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459870035] [2021-11-21 00:25:54,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:25:54,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:25:54,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:25:54,991 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:25:54,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-21 00:25:55,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 00:25:55,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:25:55,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-21 00:25:55,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:25:55,577 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-21 00:25:55,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,616 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-21 00:25:55,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,667 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-21 00:25:55,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,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-21 00:25:55,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:25:55,858 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-21 00:25:55,858 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-21 00:25:55,956 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-21 00:25:55,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:25:56,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:25:56,848 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-21 00:25:56,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459870035] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:25:56,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1272382227] [2021-11-21 00:25:56,848 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-21 00:25:56,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:25:56,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 00:25:56,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458834694] [2021-11-21 00:25:56,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:25:56,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 00:25:56,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:25:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 00:25:56,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2021-11-21 00:25:56,851 INFO L87 Difference]: Start difference. First operand 18616 states and 40782 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-21 00:26:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:26:01,159 INFO L93 Difference]: Finished difference Result 36745 states and 79802 transitions. [2021-11-21 00:26:01,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-21 00:26:01,160 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-21 00:26:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:26:01,226 INFO L225 Difference]: With dead ends: 36745 [2021-11-21 00:26:01,226 INFO L226 Difference]: Without dead ends: 36745 [2021-11-21 00:26:01,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=659, Invalid=2311, Unknown=0, NotChecked=0, Total=2970 [2021-11-21 00:26:01,229 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 985 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 3905 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 3905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:26:01,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 314 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 3905 Invalid, 0 Unknown, 34 Unchecked, 3.3s Time] [2021-11-21 00:26:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36745 states. [2021-11-21 00:26:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36745 to 24701. [2021-11-21 00:26:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24701 states, 24688 states have (on average 2.209332469215813) internal successors, (54544), 24700 states have internal predecessors, (54544), 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-21 00:26:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24701 states to 24701 states and 54544 transitions. [2021-11-21 00:26:01,913 INFO L78 Accepts]: Start accepts. Automaton has 24701 states and 54544 transitions. Word has length 45 [2021-11-21 00:26:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:26:01,914 INFO L470 AbstractCegarLoop]: Abstraction has 24701 states and 54544 transitions. [2021-11-21 00:26:01,914 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-21 00:26:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 24701 states and 54544 transitions. [2021-11-21 00:26:01,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:26:01,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:26:01,918 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-21 00:26:01,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-21 00:26:02,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-21 00:26:02,147 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-21 00:26:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:26:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash -301776767, now seen corresponding path program 2 times [2021-11-21 00:26:02,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:26:02,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332123742] [2021-11-21 00:26:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:26:02,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:26:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:26:02,332 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-21 00:26:02,332 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:26:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332123742] [2021-11-21 00:26:02,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332123742] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:26:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112953029] [2021-11-21 00:26:02,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:26:02,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:26:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:26:02,334 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:26:02,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-21 00:26:02,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 00:26:02,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:26:02,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-21 00:26:02,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:26:02,752 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-21 00:26:02,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,810 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-21 00:26:02,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,843 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-21 00:26:02,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,882 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:26:02,882 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-21 00:26:02,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:02,947 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-21 00:26:02,947 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-21 00:26:02,999 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-21 00:26:03,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:26:04,635 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-21 00:26:04,654 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-21 00:26:04,654 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-21 00:26:04,656 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-21 00:26:04,658 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-21 00:26:04,800 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-21 00:26:04,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112953029] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:26:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2015551277] [2021-11-21 00:26:04,800 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-21 00:26:04,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:26:04,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2021-11-21 00:26:04,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328166164] [2021-11-21 00:26:04,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:26:04,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-21 00:26:04,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:26:04,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-21 00:26:04,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=647, Unknown=1, NotChecked=52, Total=812 [2021-11-21 00:26:04,805 INFO L87 Difference]: Start difference. First operand 24701 states and 54544 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-21 00:26:07,371 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-21 00:26:11,258 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-21 00:26:14,054 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-21 00:26:15,572 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-21 00:26:17,607 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-21 00:26:20,857 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-21 00:26:22,975 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-21 00:26:25,055 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-21 00:26:28,641 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-21 00:26:33,501 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-21 00:26:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:26:34,844 INFO L93 Difference]: Finished difference Result 131102 states and 288557 transitions. [2021-11-21 00:26:34,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-11-21 00:26:34,845 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-21 00:26:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:26:35,195 INFO L225 Difference]: With dead ends: 131102 [2021-11-21 00:26:35,195 INFO L226 Difference]: Without dead ends: 131102 [2021-11-21 00:26:35,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 8068 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=2639, Invalid=17986, Unknown=11, NotChecked=3234, Total=23870 [2021-11-21 00:26:35,198 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1702 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 11004 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 14518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 11004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3082 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:26:35,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 547 Invalid, 14518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 11004 Invalid, 0 Unknown, 3082 Unchecked, 8.2s Time] [2021-11-21 00:26:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131102 states. [2021-11-21 00:26:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131102 to 62541. [2021-11-21 00:26:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62541 states, 62528 states have (on average 2.2243954708290685) internal successors, (139087), 62540 states have internal predecessors, (139087), 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-21 00:26:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62541 states to 62541 states and 139087 transitions. [2021-11-21 00:26:37,897 INFO L78 Accepts]: Start accepts. Automaton has 62541 states and 139087 transitions. Word has length 45 [2021-11-21 00:26:37,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:26:37,897 INFO L470 AbstractCegarLoop]: Abstraction has 62541 states and 139087 transitions. [2021-11-21 00:26:37,897 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-21 00:26:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 62541 states and 139087 transitions. [2021-11-21 00:26:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:26:38,175 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:26:38,175 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-21 00:26:38,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-21 00:26:38,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-21 00:26:38,375 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-21 00:26:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:26:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash -349144457, now seen corresponding path program 3 times [2021-11-21 00:26:38,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:26:38,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819527271] [2021-11-21 00:26:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:26:38,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:26:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:26:38,804 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-21 00:26:38,804 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:26:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819527271] [2021-11-21 00:26:38,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819527271] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:26:38,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211906208] [2021-11-21 00:26:38,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 00:26:38,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:26:38,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:26:38,806 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:26:38,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-21 00:26:39,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 00:26:39,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:26:39,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-21 00:26:39,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:26:39,635 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-21 00:26:39,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,691 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-21 00:26:39,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,776 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-21 00:26:39,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,827 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-21 00:26:39,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:39,897 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-21 00:26:39,949 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-21 00:26:39,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:26:40,268 INFO L354 Elim1Store]: treesize reduction 83, result has 25.9 percent of original size [2021-11-21 00:26:40,269 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-21 00:26:40,272 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-21 00:26:40,278 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-21 00:26:40,278 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-21 00:26:40,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:26:40,328 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-21 00:26:40,328 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-21 00:26:40,333 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-21 00:26:40,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:26:40,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:26:40,339 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-21 00:26:40,722 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-21 00:26:40,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211906208] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:26:40,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1069677411] [2021-11-21 00:26:40,723 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-21 00:26:40,723 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:26:40,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-21 00:26:40,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960111951] [2021-11-21 00:26:40,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:26:40,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-21 00:26:40,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:26:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-21 00:26:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-11-21 00:26:40,725 INFO L87 Difference]: Start difference. First operand 62541 states and 139087 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-21 00:26:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:26:47,625 INFO L93 Difference]: Finished difference Result 85461 states and 188325 transitions. [2021-11-21 00:26:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-21 00:26:47,626 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-21 00:26:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:26:47,833 INFO L225 Difference]: With dead ends: 85461 [2021-11-21 00:26:47,833 INFO L226 Difference]: Without dead ends: 85461 [2021-11-21 00:26:47,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1401, Invalid=5405, Unknown=0, NotChecked=0, Total=6806 [2021-11-21 00:26:47,834 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 1113 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 4938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:26:47,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1113 Valid, 230 Invalid, 4938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 4312 Invalid, 0 Unknown, 316 Unchecked, 4.1s Time] [2021-11-21 00:26:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85461 states. [2021-11-21 00:26:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85461 to 25132. [2021-11-21 00:26:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25132 states, 25119 states have (on average 2.2083681675225924) internal successors, (55472), 25131 states have internal predecessors, (55472), 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-21 00:26:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25132 states to 25132 states and 55472 transitions. [2021-11-21 00:26:49,122 INFO L78 Accepts]: Start accepts. Automaton has 25132 states and 55472 transitions. Word has length 45 [2021-11-21 00:26:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:26:49,122 INFO L470 AbstractCegarLoop]: Abstraction has 25132 states and 55472 transitions. [2021-11-21 00:26:49,123 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-21 00:26:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 25132 states and 55472 transitions. [2021-11-21 00:26:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:26:49,126 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:26:49,126 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-21 00:26:49,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-11-21 00:26:49,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-21 00:26:49,343 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-21 00:26:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:26:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash -484149272, now seen corresponding path program 2 times [2021-11-21 00:26:49,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:26:49,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653611289] [2021-11-21 00:26:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:26:49,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:26:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:26:50,252 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-21 00:26:50,252 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:26:50,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653611289] [2021-11-21 00:26:50,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653611289] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:26:50,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134493917] [2021-11-21 00:26:50,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:26:50,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:26:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:26:50,255 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:26:50,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-21 00:26:50,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 00:26:50,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:26:50,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-21 00:26:50,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:26:50,801 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-21 00:26:50,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:50,872 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-21 00:26:50,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:50,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:50,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:50,935 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-21 00:26:51,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,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-21 00:26:51,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,239 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-21 00:26:51,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,354 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-21 00:26:51,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,487 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-21 00:26:51,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,628 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-21 00:26:51,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:26:51,978 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 00:26:51,978 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-21 00:27:04,130 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-21 00:27:04,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:27:07,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:07,700 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-21 00:27:07,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134493917] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:27:07,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927787123] [2021-11-21 00:27:07,701 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-21 00:27:07,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:27:07,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-21 00:27:07,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467681219] [2021-11-21 00:27:07,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:27:07,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-21 00:27:07,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:27:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-21 00:27:07,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1266, Unknown=5, NotChecked=0, Total=1560 [2021-11-21 00:27:07,705 INFO L87 Difference]: Start difference. First operand 25132 states and 55472 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-21 00:27:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:27:41,305 INFO L93 Difference]: Finished difference Result 40708 states and 88034 transitions. [2021-11-21 00:27:41,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-21 00:27:41,306 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-21 00:27:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:27:41,387 INFO L225 Difference]: With dead ends: 40708 [2021-11-21 00:27:41,388 INFO L226 Difference]: Without dead ends: 40708 [2021-11-21 00:27:41,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1862 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=1217, Invalid=4619, Unknown=16, NotChecked=0, Total=5852 [2021-11-21 00:27:41,389 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 1114 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 2780 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 4408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 2780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1404 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-21 00:27:41,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 278 Invalid, 4408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 2780 Invalid, 0 Unknown, 1404 Unchecked, 2.6s Time] [2021-11-21 00:27:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40708 states. [2021-11-21 00:27:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40708 to 26231. [2021-11-21 00:27:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26231 states, 26218 states have (on average 2.1997101228163856) internal successors, (57672), 26230 states have internal predecessors, (57672), 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-21 00:27:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26231 states to 26231 states and 57672 transitions. [2021-11-21 00:27:42,192 INFO L78 Accepts]: Start accepts. Automaton has 26231 states and 57672 transitions. Word has length 45 [2021-11-21 00:27:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:27:42,193 INFO L470 AbstractCegarLoop]: Abstraction has 26231 states and 57672 transitions. [2021-11-21 00:27:42,193 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-21 00:27:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 26231 states and 57672 transitions. [2021-11-21 00:27:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:27:42,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:27:42,196 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-21 00:27:42,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-21 00:27:42,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:27:42,399 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 00:27:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:27:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -56898170, now seen corresponding path program 3 times [2021-11-21 00:27:42,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:27:42,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941805078] [2021-11-21 00:27:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:27:42,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:27:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:27:43,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-21 00:27:43,177 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:27:43,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941805078] [2021-11-21 00:27:43,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941805078] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:27:43,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95209814] [2021-11-21 00:27:43,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 00:27:43,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:27:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:27:43,179 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:27:43,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-21 00:27:43,440 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 00:27:43,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:27:43,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-21 00:27:43,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:27:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-21 00:27:43,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:43,935 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-21 00:27:43,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:43,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,000 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-21 00:27:44,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,089 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-21 00:27:44,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,312 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-21 00:27:44,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,416 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-21 00:27:44,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,542 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-21 00:27:44,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,685 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-21 00:27:44,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:44,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:27:45,017 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 00:27:45,017 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-21 00:27:53,175 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-21 00:27:53,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:27:57,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,412 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:27:57,987 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-21 00:27:57,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95209814] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:27:57,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [843732233] [2021-11-21 00:27:57,988 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-21 00:27:57,988 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:27:57,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-21 00:27:57,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332298384] [2021-11-21 00:27:57,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:27:57,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-21 00:27:57,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:27:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-21 00:27:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1279, Unknown=3, NotChecked=0, Total=1560 [2021-11-21 00:27:57,990 INFO L87 Difference]: Start difference. First operand 26231 states and 57672 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-21 00:28:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:28:14,787 INFO L93 Difference]: Finished difference Result 40951 states and 88554 transitions. [2021-11-21 00:28:14,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-21 00:28:14,788 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-21 00:28:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:28:14,867 INFO L225 Difference]: With dead ends: 40951 [2021-11-21 00:28:14,867 INFO L226 Difference]: Without dead ends: 40951 [2021-11-21 00:28:14,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=1401, Invalid=4911, Unknown=8, NotChecked=0, Total=6320 [2021-11-21 00:28:14,869 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 982 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1867 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:28:14,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 394 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 4053 Invalid, 0 Unknown, 1867 Unchecked, 3.5s Time] [2021-11-21 00:28:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40951 states. [2021-11-21 00:28:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40951 to 26368. [2021-11-21 00:28:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26368 states, 26355 states have (on average 2.199468791500664) internal successors, (57967), 26367 states have internal predecessors, (57967), 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-21 00:28:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26368 states to 26368 states and 57967 transitions. [2021-11-21 00:28:15,614 INFO L78 Accepts]: Start accepts. Automaton has 26368 states and 57967 transitions. Word has length 45 [2021-11-21 00:28:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:28:15,614 INFO L470 AbstractCegarLoop]: Abstraction has 26368 states and 57967 transitions. [2021-11-21 00:28:15,615 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-21 00:28:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 26368 states and 57967 transitions. [2021-11-21 00:28:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:28:15,618 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:28:15,618 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-21 00:28:15,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-21 00:28:15,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-21 00:28:15,826 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-21 00:28:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:28:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2104107844, now seen corresponding path program 4 times [2021-11-21 00:28:15,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:28:15,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956106140] [2021-11-21 00:28:15,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:28:15,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:28:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:28:16,523 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-21 00:28:16,523 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:28:16,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956106140] [2021-11-21 00:28:16,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956106140] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:28:16,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014677436] [2021-11-21 00:28:16,525 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 00:28:16,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:28:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:28:16,525 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:28:16,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-21 00:28:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:28:16,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-21 00:28:16,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:28:17,122 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-21 00:28:17,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,190 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-21 00:28:17,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,252 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-21 00:28:17,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,323 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-21 00:28:17,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,430 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-21 00:28:17,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,547 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-21 00:28:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,700 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-21 00:28:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:17,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:18,013 INFO L354 Elim1Store]: treesize reduction 475, result has 11.5 percent of original size [2021-11-21 00:28:18,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 97 treesize of output 103 [2021-11-21 00:28:26,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:26,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:26,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:26,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:26,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:26,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:28:26,215 INFO L354 Elim1Store]: treesize reduction 288, result has 11.4 percent of original size [2021-11-21 00:28:26,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 98 [2021-11-21 00:28:28,347 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-21 00:28:28,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:28:30,894 INFO L354 Elim1Store]: treesize reduction 938, result has 4.8 percent of original size [2021-11-21 00:28:30,895 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 7 case distinctions, treesize of input 164 treesize of output 59 [2021-11-21 00:28:30,902 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:28:30,902 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 51 treesize of output 47 [2021-11-21 00:28:30,909 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-21 00:28:30,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 36 [2021-11-21 00:28:30,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:30,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,098 INFO L354 Elim1Store]: treesize reduction 527, result has 10.1 percent of original size [2021-11-21 00:28:31,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 166 treesize of output 73 [2021-11-21 00:28:31,107 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:28:31,107 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 63 treesize of output 57 [2021-11-21 00:28:31,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,121 INFO L354 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2021-11-21 00:28:31,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 30 [2021-11-21 00:28:31,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,295 INFO L354 Elim1Store]: treesize reduction 517, result has 11.8 percent of original size [2021-11-21 00:28:31,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 166 treesize of output 83 [2021-11-21 00:28:31,307 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-21 00:28:31,307 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 73 treesize of output 65 [2021-11-21 00:28:31,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,324 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:28:31,333 INFO L354 Elim1Store]: treesize reduction 102, result has 1.0 percent of original size [2021-11-21 00:28:31,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 34 [2021-11-21 00:28:31,701 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-21 00:28:31,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014677436] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:28:31,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2016882197] [2021-11-21 00:28:31,701 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-21 00:28:31,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:28:31,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 37 [2021-11-21 00:28:31,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97690477] [2021-11-21 00:28:31,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:28:31,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-21 00:28:31,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:28:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-21 00:28:31,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1166, Unknown=3, NotChecked=0, Total=1406 [2021-11-21 00:28:31,704 INFO L87 Difference]: Start difference. First operand 26368 states and 57967 transitions. Second operand has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 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-21 00:29:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:29:30,638 INFO L93 Difference]: Finished difference Result 41609 states and 90058 transitions. [2021-11-21 00:29:30,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-21 00:29:30,638 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 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-21 00:29:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:29:30,715 INFO L225 Difference]: With dead ends: 41609 [2021-11-21 00:29:30,715 INFO L226 Difference]: Without dead ends: 41609 [2021-11-21 00:29:30,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 78 SyntacticMatches, 24 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2710 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=1582, Invalid=5201, Unknown=23, NotChecked=0, Total=6806 [2021-11-21 00:29:30,716 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 979 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3698 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 5141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 3698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1274 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:29:30,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [979 Valid, 352 Invalid, 5141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 3698 Invalid, 0 Unknown, 1274 Unchecked, 3.1s Time] [2021-11-21 00:29:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41609 states. [2021-11-21 00:29:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41609 to 26487. [2021-11-21 00:29:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26487 states, 26474 states have (on average 2.199138777668656) internal successors, (58220), 26486 states have internal predecessors, (58220), 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-21 00:29:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 58220 transitions. [2021-11-21 00:29:31,398 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 58220 transitions. Word has length 45 [2021-11-21 00:29:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:29:31,398 INFO L470 AbstractCegarLoop]: Abstraction has 26487 states and 58220 transitions. [2021-11-21 00:29:31,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 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-21 00:29:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 58220 transitions. [2021-11-21 00:29:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:29:31,402 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:29:31,403 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-21 00:29:31,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-21 00:29:31,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-21 00:29:31,616 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-21 00:29:31,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:29:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -737752836, now seen corresponding path program 5 times [2021-11-21 00:29:31,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:29:31,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050367188] [2021-11-21 00:29:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:29:31,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:29:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:29:32,535 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-21 00:29:32,535 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:29:32,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050367188] [2021-11-21 00:29:32,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050367188] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:29:32,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300879056] [2021-11-21 00:29:32,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-21 00:29:32,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:29:32,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:29:32,536 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:29:32,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-21 00:29:32,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-21 00:29:32,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:29:32,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-21 00:29:32,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:29:33,277 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-21 00:29:33,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,339 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-21 00:29:33,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,409 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-21 00:29:33,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,486 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-21 00:29:33,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,580 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-21 00:29:33,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,687 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-21 00:29:33,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,799 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-21 00:29:33,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:33,939 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-21 00:29:34,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:34,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:34,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:34,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:34,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:34,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:29:34,276 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 00:29:34,276 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-21 00:29:44,413 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-21 00:29:44,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:29:47,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:29:47,868 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-21 00:29:47,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300879056] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:29:47,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1861850060] [2021-11-21 00:29:47,868 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-21 00:29:47,869 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:29:47,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-21 00:29:47,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557560140] [2021-11-21 00:29:47,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:29:47,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-21 00:29:47,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:29:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-21 00:29:47,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1197, Unknown=4, NotChecked=0, Total=1482 [2021-11-21 00:29:47,872 INFO L87 Difference]: Start difference. First operand 26487 states and 58220 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-21 00:30:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:10,069 INFO L93 Difference]: Finished difference Result 46767 states and 101589 transitions. [2021-11-21 00:30:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-21 00:30:10,070 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-21 00:30:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:10,167 INFO L225 Difference]: With dead ends: 46767 [2021-11-21 00:30:10,167 INFO L226 Difference]: Without dead ends: 46767 [2021-11-21 00:30:10,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 75 SyntacticMatches, 23 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2848 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=1491, Invalid=5470, Unknown=11, NotChecked=0, Total=6972 [2021-11-21 00:30:10,168 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 1223 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1827 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:10,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1223 Valid, 303 Invalid, 6128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 4053 Invalid, 0 Unknown, 1827 Unchecked, 3.7s Time] [2021-11-21 00:30:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46767 states. [2021-11-21 00:30:10,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46767 to 26509. [2021-11-21 00:30:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26509 states, 26496 states have (on average 2.1984827898550723) internal successors, (58251), 26508 states have internal predecessors, (58251), 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-21 00:30:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26509 states to 26509 states and 58251 transitions. [2021-11-21 00:30:11,006 INFO L78 Accepts]: Start accepts. Automaton has 26509 states and 58251 transitions. Word has length 45 [2021-11-21 00:30:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:11,007 INFO L470 AbstractCegarLoop]: Abstraction has 26509 states and 58251 transitions. [2021-11-21 00:30:11,007 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-21 00:30:11,007 INFO L276 IsEmpty]: Start isEmpty. Operand 26509 states and 58251 transitions. [2021-11-21 00:30:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:30:11,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:11,011 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-21 00:30:11,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:11,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-21 00:30:11,223 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 00:30:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash 679382453, now seen corresponding path program 7 times [2021-11-21 00:30:11,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:30:11,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915496831] [2021-11-21 00:30:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:11,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:30:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:11,619 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-21 00:30:11,619 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:30:11,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915496831] [2021-11-21 00:30:11,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915496831] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:30:11,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653313813] [2021-11-21 00:30:11,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 00:30:11,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:30:11,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:30:11,621 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:30:11,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-21 00:30:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:11,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-21 00:30:11,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:12,103 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-21 00:30:12,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,153 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-21 00:30:12,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,219 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-21 00:30:12,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:12,311 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-21 00:30:12,440 INFO L354 Elim1Store]: treesize reduction 204, result has 14.6 percent of original size [2021-11-21 00:30:12,440 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-21 00:30:12,535 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-21 00:30:12,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:30:12,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:12,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-21 00:30:13,405 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-21 00:30:13,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653313813] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:30:13,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [519087020] [2021-11-21 00:30:13,405 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-21 00:30:13,406 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:30:13,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 00:30:13,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816081685] [2021-11-21 00:30:13,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:30:13,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 00:30:13,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:30:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 00:30:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2021-11-21 00:30:13,408 INFO L87 Difference]: Start difference. First operand 26509 states and 58251 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-21 00:30:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:30:23,183 INFO L93 Difference]: Finished difference Result 40018 states and 85943 transitions. [2021-11-21 00:30:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-11-21 00:30:23,183 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-21 00:30:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:30:23,274 INFO L225 Difference]: With dead ends: 40018 [2021-11-21 00:30:23,275 INFO L226 Difference]: Without dead ends: 40018 [2021-11-21 00:30:23,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3752 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2245, Invalid=9097, Unknown=0, NotChecked=0, Total=11342 [2021-11-21 00:30:23,277 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 1117 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 5112 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 5624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 5112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:30:23,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1117 Valid, 410 Invalid, 5624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 5112 Invalid, 0 Unknown, 102 Unchecked, 5.8s Time] [2021-11-21 00:30:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40018 states. [2021-11-21 00:30:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40018 to 29131. [2021-11-21 00:30:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29131 states, 29118 states have (on average 2.180506902946631) internal successors, (63492), 29130 states have internal predecessors, (63492), 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-21 00:30:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29131 states to 29131 states and 63492 transitions. [2021-11-21 00:30:24,176 INFO L78 Accepts]: Start accepts. Automaton has 29131 states and 63492 transitions. Word has length 45 [2021-11-21 00:30:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:30:24,177 INFO L470 AbstractCegarLoop]: Abstraction has 29131 states and 63492 transitions. [2021-11-21 00:30:24,177 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-21 00:30:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 29131 states and 63492 transitions. [2021-11-21 00:30:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:30:24,179 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:30:24,179 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-21 00:30:24,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-21 00:30:24,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-21 00:30:24,383 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 00:30:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:30:24,385 INFO L85 PathProgramCache]: Analyzing trace with hash 911917160, now seen corresponding path program 6 times [2021-11-21 00:30:24,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:30:24,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18546091] [2021-11-21 00:30:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:30:24,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:30:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:30:25,300 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-21 00:30:25,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:30:25,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18546091] [2021-11-21 00:30:25,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18546091] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:30:25,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135006572] [2021-11-21 00:30:25,301 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 00:30:25,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:30:25,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:30:25,307 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:30:25,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-21 00:30:25,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 00:30:25,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:30:25,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjunts are in the unsatisfiable core [2021-11-21 00:30:25,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:30:26,042 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-21 00:30:26,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,158 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-21 00:30:26,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,223 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-21 00:30:26,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,302 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-21 00:30:26,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,396 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-21 00:30:26,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,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-21 00:30:26,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,622 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-21 00:30:26,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,761 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-21 00:30:26,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:26,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:30:27,098 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 00:30:27,099 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-21 00:30:39,243 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-21 00:30:39,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:30:44,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse1 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse3 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse6 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) is different from false [2021-11-21 00:30:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2021-11-21 00:30:44,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135006572] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:30:44,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1689135100] [2021-11-21 00:30:44,487 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-21 00:30:44,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:30:44,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-21 00:30:44,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517941119] [2021-11-21 00:30:44,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:30:44,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-21 00:30:44,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:30:44,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-21 00:30:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1223, Unknown=6, NotChecked=74, Total=1560 [2021-11-21 00:30:44,489 INFO L87 Difference]: Start difference. First operand 29131 states and 63492 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-21 00:30:47,414 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse1 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse3 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse6 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))))) (= |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-21 00:31:15,480 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse2 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse4 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (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) (+ |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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse7 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#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-21 00:31:28,561 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse2 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse4 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (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) (+ |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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse7 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |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-21 00:31:30,500 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) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| Int)) (or (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0) .cse2 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse4 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182| Int)) (= (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) (+ |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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |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_182| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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) .cse7 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_524| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_182|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_524| (+ |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-21 00:31:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:31:31,836 INFO L93 Difference]: Finished difference Result 85816 states and 185092 transitions. [2021-11-21 00:31:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-21 00:31:31,837 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-21 00:31:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:31:32,022 INFO L225 Difference]: With dead ends: 85816 [2021-11-21 00:31:32,022 INFO L226 Difference]: Without dead ends: 85816 [2021-11-21 00:31:32,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 81 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 60.5s TimeCoverageRelationStatistics Valid=1097, Invalid=6555, Unknown=24, NotChecked=880, Total=8556 [2021-11-21 00:31:32,023 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 688 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 4438 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 8078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 4438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3504 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:31:32,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [688 Valid, 603 Invalid, 8078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 4438 Invalid, 0 Unknown, 3504 Unchecked, 3.7s Time] [2021-11-21 00:31:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85816 states. [2021-11-21 00:31:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85816 to 59946. [2021-11-21 00:31:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59946 states, 59933 states have (on average 2.17963392454908) internal successors, (130632), 59945 states have internal predecessors, (130632), 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-21 00:31:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59946 states to 59946 states and 130632 transitions. [2021-11-21 00:31:33,507 INFO L78 Accepts]: Start accepts. Automaton has 59946 states and 130632 transitions. Word has length 45 [2021-11-21 00:31:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:31:33,507 INFO L470 AbstractCegarLoop]: Abstraction has 59946 states and 130632 transitions. [2021-11-21 00:31:33,507 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-21 00:31:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 59946 states and 130632 transitions. [2021-11-21 00:31:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:31:33,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:31:33,511 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-21 00:31:33,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-21 00:31:33,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:31:33,712 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 00:31:33,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:31:33,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1752492082, now seen corresponding path program 7 times [2021-11-21 00:31:33,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:31:33,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806914089] [2021-11-21 00:31:33,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:31:33,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:31:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:31:34,529 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-21 00:31:34,530 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:31:34,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806914089] [2021-11-21 00:31:34,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806914089] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:31:34,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389047213] [2021-11-21 00:31:34,530 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 00:31:34,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:31:34,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:31:34,531 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:31:34,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-21 00:31:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:31:34,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-21 00:31:34,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:31:34,993 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-21 00:31:35,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,062 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-21 00:31:35,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,118 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-21 00:31:35,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,195 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-21 00:31:35,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,395 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-21 00:31:35,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,495 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-21 00:31:35,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,611 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-21 00:31:35,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,746 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-21 00:31:35,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:35,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:31:36,083 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-21 00:31:36,084 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-21 00:31:50,230 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-21 00:31:50,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:32:22,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse1 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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) .cse3 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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse6 0) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))))) is different from false [2021-11-21 00:32:28,474 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-21 00:32:28,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389047213] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:32:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [77523435] [2021-11-21 00:32:28,474 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-21 00:32:28,475 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:32:28,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-21 00:32:28,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596549879] [2021-11-21 00:32:28,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:32:28,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-21 00:32:28,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:32:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-21 00:32:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1170, Unknown=17, NotChecked=72, Total=1482 [2021-11-21 00:32:28,476 INFO L87 Difference]: Start difference. First operand 59946 states and 130632 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-21 00:32:31,351 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse1 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (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|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse1 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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse1)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (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) .cse3 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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse3)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (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) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse6 0) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6)) 0))))) (= |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|) (= |c_~#cache~0.base| 1)) is different from false [2021-11-21 00:32:59,248 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)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| 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 (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) .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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (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) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse7 0) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))))) (= |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|) (= |c_~#cache~0.base| 1))) is different from false [2021-11-21 00:33:02,766 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)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| 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 (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) .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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (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) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse7 0) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 0))))) (= (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|))) is different from false [2021-11-21 00:33:04,358 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)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| 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 (store (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| 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 (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) .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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187| Int)) (= (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) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |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_187| Int)) (= (let ((.cse7 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (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|) .cse7 0) (+ |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_526| 1) 0) (+ 2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) (+ 3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526|) 0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_526| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_187|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse7)) 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|))) is different from false [2021-11-21 00:33:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:33:05,453 INFO L93 Difference]: Finished difference Result 125234 states and 271324 transitions. [2021-11-21 00:33:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-21 00:33:05,453 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-21 00:33:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:33:05,723 INFO L225 Difference]: With dead ends: 125234 [2021-11-21 00:33:05,723 INFO L226 Difference]: Without dead ends: 125234 [2021-11-21 00:33:05,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 85.7s TimeCoverageRelationStatistics Valid=735, Invalid=3946, Unknown=31, NotChecked=690, Total=5402 [2021-11-21 00:33:05,724 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 786 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 3979 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 6960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 3979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2838 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-21 00:33:05,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [786 Valid, 650 Invalid, 6960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 3979 Invalid, 0 Unknown, 2838 Unchecked, 2.9s Time] [2021-11-21 00:33:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125234 states. [2021-11-21 00:33:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125234 to 60267. [2021-11-21 00:33:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60267 states, 60254 states have (on average 2.180602117701729) internal successors, (131390), 60266 states have internal predecessors, (131390), 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-21 00:33:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60267 states to 60267 states and 131390 transitions. [2021-11-21 00:33:07,834 INFO L78 Accepts]: Start accepts. Automaton has 60267 states and 131390 transitions. Word has length 45 [2021-11-21 00:33:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:33:07,834 INFO L470 AbstractCegarLoop]: Abstraction has 60267 states and 131390 transitions. [2021-11-21 00:33:07,834 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-21 00:33:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 60267 states and 131390 transitions. [2021-11-21 00:33:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:33:07,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:33:07,837 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-21 00:33:07,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-11-21 00:33:08,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:33:08,038 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-21 00:33:08,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:33:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1421222459, now seen corresponding path program 3 times [2021-11-21 00:33:08,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:33:08,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852508101] [2021-11-21 00:33:08,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:33:08,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:33:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:33:08,381 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-21 00:33:08,381 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:33:08,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852508101] [2021-11-21 00:33:08,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852508101] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:33:08,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509386549] [2021-11-21 00:33:08,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-21 00:33:08,382 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:33:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:33:08,383 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:33:08,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-11-21 00:33:08,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-21 00:33:08,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-21 00:33:08,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-21 00:33:08,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:33:09,359 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-21 00:33:09,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,439 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-21 00:33:09,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,490 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-21 00:33:09,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,583 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-21 00:33:09,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:09,740 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-21 00:33:09,740 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-21 00:33:09,832 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-21 00:33:09,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:33:21,797 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-21 00:33:21,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509386549] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:33:21,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1192772420] [2021-11-21 00:33:21,797 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-21 00:33:21,798 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 00:33:21,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2021-11-21 00:33:21,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404324215] [2021-11-21 00:33:21,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 00:33:21,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-21 00:33:21,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:33:21,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-21 00:33:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=837, Unknown=6, NotChecked=0, Total=992 [2021-11-21 00:33:21,799 INFO L87 Difference]: Start difference. First operand 60267 states and 131390 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-21 00:33:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:33:25,712 INFO L93 Difference]: Finished difference Result 70608 states and 153240 transitions. [2021-11-21 00:33:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-21 00:33:25,713 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-21 00:33:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:33:25,856 INFO L225 Difference]: With dead ends: 70608 [2021-11-21 00:33:25,857 INFO L226 Difference]: Without dead ends: 70608 [2021-11-21 00:33:25,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=558, Invalid=1986, Unknown=6, NotChecked=0, Total=2550 [2021-11-21 00:33:25,857 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 579 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 706 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-11-21 00:33:25,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 387 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2381 Invalid, 0 Unknown, 706 Unchecked, 2.7s Time] [2021-11-21 00:33:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70608 states. [2021-11-21 00:33:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70608 to 60204. [2021-11-21 00:33:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60204 states, 60191 states have (on average 2.1808243757372363) internal successors, (131266), 60203 states have internal predecessors, (131266), 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-21 00:33:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60204 states to 60204 states and 131266 transitions. [2021-11-21 00:33:27,593 INFO L78 Accepts]: Start accepts. Automaton has 60204 states and 131266 transitions. Word has length 45 [2021-11-21 00:33:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:33:27,593 INFO L470 AbstractCegarLoop]: Abstraction has 60204 states and 131266 transitions. [2021-11-21 00:33:27,593 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-21 00:33:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 60204 states and 131266 transitions. [2021-11-21 00:33:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-21 00:33:27,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:33:27,597 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-21 00:33:27,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-11-21 00:33:27,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:33:27,797 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2021-11-21 00:33:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:33:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash -418809313, now seen corresponding path program 4 times [2021-11-21 00:33:27,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:33:27,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752216337] [2021-11-21 00:33:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:33:27,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:33:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:33:28,452 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-21 00:33:28,453 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:33:28,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752216337] [2021-11-21 00:33:28,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752216337] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 00:33:28,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196968799] [2021-11-21 00:33:28,453 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-21 00:33:28,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:33:28,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:33:28,455 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:33:28,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97b2ecb4-355c-45d5-bdbd-2225da6d767d/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-11-21 00:33:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:33:28,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-21 00:33:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:33:29,123 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-21 00:33:29,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,178 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-21 00:33:29,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,245 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-21 00:33:29,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,329 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-21 00:33:29,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 00:33:29,555 INFO L354 Elim1Store]: treesize reduction 114, result has 23.5 percent of original size [2021-11-21 00:33:29,555 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-21 00:33:29,647 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-21 00:33:29,647 INFO L328 TraceCheckSpWp]: Computing backward predicates...