./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/config/TaipanReach.xml -i ../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs --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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-19 13:42:12,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-19 13:42:12,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-19 13:42:12,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-19 13:42:12,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-19 13:42:12,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-19 13:42:12,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-19 13:42:12,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-19 13:42:12,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-19 13:42:12,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-19 13:42:12,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-19 13:42:12,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-19 13:42:12,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-19 13:42:12,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-19 13:42:12,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-19 13:42:12,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-19 13:42:12,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-19 13:42:12,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-19 13:42:12,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-19 13:42:12,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-19 13:42:12,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-19 13:42:12,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-19 13:42:12,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-19 13:42:12,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-19 13:42:12,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-19 13:42:12,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-19 13:42:12,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-19 13:42:12,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-19 13:42:12,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-19 13:42:12,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-19 13:42:12,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-19 13:42:12,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-19 13:42:12,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-19 13:42:12,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-19 13:42:12,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-19 13:42:12,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-19 13:42:12,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-19 13:42:12,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-19 13:42:12,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-19 13:42:12,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-19 13:42:12,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-19 13:42:12,448 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/config/svcomp-DataRace-32bit-Taipan_Default.epf [2021-11-19 13:42:12,495 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-19 13:42:12,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-19 13:42:12,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-19 13:42:12,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-19 13:42:12,498 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-19 13:42:12,498 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-19 13:42:12,498 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-19 13:42:12,499 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-19 13:42:12,499 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-19 13:42:12,499 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-19 13:42:12,499 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-19 13:42:12,500 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-19 13:42:12,500 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-19 13:42:12,500 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-19 13:42:12,501 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-19 13:42:12,501 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-19 13:42:12,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-19 13:42:12,502 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-19 13:42:12,503 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-19 13:42:12,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-19 13:42:12,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-19 13:42:12,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-19 13:42:12,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-19 13:42:12,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-19 13:42:12,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-19 13:42:12,505 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-19 13:42:12,505 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-19 13:42:12,505 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-19 13:42:12,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-19 13:42:12,506 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-19 13:42:12,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-19 13:42:12,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-19 13:42:12,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-19 13:42:12,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:42:12,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-19 13:42:12,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-19 13:42:12,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-19 13:42:12,508 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-19 13:42:12,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-19 13:42:12,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-19 13:42:12,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-19 13:42:12,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-19 13:42:12,510 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_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/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_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2021-11-19 13:42:12,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-19 13:42:12,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-19 13:42:12,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-19 13:42:12,837 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-19 13:42:12,838 INFO L275 PluginConnector]: CDTParser initialized [2021-11-19 13:42:12,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/../../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-19 13:42:12,925 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/data/8f6cadb82/ae1f189cab6b4c75a714d288101dc4ce/FLAG2134d257e [2021-11-19 13:42:13,636 INFO L306 CDTParser]: Found 1 translation units. [2021-11-19 13:42:13,637 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2021-11-19 13:42:13,668 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/data/8f6cadb82/ae1f189cab6b4c75a714d288101dc4ce/FLAG2134d257e [2021-11-19 13:42:13,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/data/8f6cadb82/ae1f189cab6b4c75a714d288101dc4ce [2021-11-19 13:42:13,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-19 13:42:13,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-19 13:42:13,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-19 13:42:13,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-19 13:42:13,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-19 13:42:13,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:42:13" (1/1) ... [2021-11-19 13:42:13,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcd87c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:13, skipping insertion in model container [2021-11-19 13:42:13,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:42:13" (1/1) ... [2021-11-19 13:42:13,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-19 13:42:13,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-19 13:42:14,660 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:42:14,681 INFO L203 MainTranslator]: Completed pre-run [2021-11-19 13:42:14,740 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-19 13:42:14,853 INFO L208 MainTranslator]: Completed translation [2021-11-19 13:42:14,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14 WrapperNode [2021-11-19 13:42:14,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-19 13:42:14,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-19 13:42:14,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-19 13:42:14,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-19 13:42:14,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:14,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:14,925 INFO L137 Inliner]: procedures = 261, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2021-11-19 13:42:14,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-19 13:42:14,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-19 13:42:14,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-19 13:42:14,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-19 13:42:14,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:14,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:14,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:14,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:14,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:14,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:15,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:15,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-19 13:42:15,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-19 13:42:15,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-19 13:42:15,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-19 13:42:15,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (1/1) ... [2021-11-19 13:42:15,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-19 13:42:15,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:15,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-19 13:42:15,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-19 13:42:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-19 13:42:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-19 13:42:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-19 13:42:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-19 13:42:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-19 13:42:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-19 13:42:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-19 13:42:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-19 13:42:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-19 13:42:15,146 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-19 13:42:15,390 INFO L236 CfgBuilder]: Building ICFG [2021-11-19 13:42:15,392 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-19 13:42:15,633 INFO L277 CfgBuilder]: Performing block encoding [2021-11-19 13:42:15,643 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-19 13:42:15,644 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-11-19 13:42:15,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:42:15 BoogieIcfgContainer [2021-11-19 13:42:15,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-19 13:42:15,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-19 13:42:15,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-19 13:42:15,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-19 13:42:15,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:42:13" (1/3) ... [2021-11-19 13:42:15,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8f249c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:42:15, skipping insertion in model container [2021-11-19 13:42:15,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:42:14" (2/3) ... [2021-11-19 13:42:15,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8f249c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:42:15, skipping insertion in model container [2021-11-19 13:42:15,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:42:15" (3/3) ... [2021-11-19 13:42:15,657 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2021-11-19 13:42:15,663 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-19 13:42:15,663 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-19 13:42:15,664 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-19 13:42:15,664 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-19 13:42:15,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,699 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,700 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,706 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-19 13:42:15,706 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-19 13:42:15,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,706 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-19 13:42:15,707 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-19 13:42:15,707 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-19 13:42:15,707 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-19 13:42:15,707 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-19 13:42:15,708 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-19 13:42:15,708 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-19 13:42:15,708 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-19 13:42:15,708 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-19 13:42:15,709 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-19 13:42:15,709 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-19 13:42:15,709 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-19 13:42:15,710 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-19 13:42:15,710 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-19 13:42:15,710 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-19 13:42:15,710 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-19 13:42:15,711 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-19 13:42:15,711 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-19 13:42:15,711 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-19 13:42:15,712 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-19 13:42:15,712 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-19 13:42:15,712 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-19 13:42:15,713 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-19 13:42:15,713 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-19 13:42:15,713 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-19 13:42:15,714 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-19 13:42:15,714 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-19 13:42:15,714 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-19 13:42:15,714 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-19 13:42:15,715 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-19 13:42:15,715 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-19 13:42:15,715 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-19 13:42:15,715 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-19 13:42:15,716 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-19 13:42:15,716 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-19 13:42:15,716 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-19 13:42:15,717 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-19 13:42:15,717 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-19 13:42:15,717 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-19 13:42:15,717 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-19 13:42:15,718 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-19 13:42:15,718 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-19 13:42:15,719 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-19 13:42:15,719 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-19 13:42:15,719 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-19 13:42:15,719 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-19 13:42:15,720 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-19 13:42:15,720 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-19 13:42:15,720 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-19 13:42:15,721 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-19 13:42:15,721 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-19 13:42:15,721 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-19 13:42:15,722 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-19 13:42:15,722 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-19 13:42:15,722 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-19 13:42:15,723 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-19 13:42:15,723 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-19 13:42:15,723 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-19 13:42:15,724 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-19 13:42:15,724 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-19 13:42:15,724 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-19 13:42:15,725 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-19 13:42:15,725 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-19 13:42:15,725 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-19 13:42:15,725 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-19 13:42:15,726 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-19 13:42:15,726 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-19 13:42:15,726 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-19 13:42:15,727 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-19 13:42:15,727 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-19 13:42:15,727 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-19 13:42:15,727 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-19 13:42:15,728 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-19 13:42:15,728 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-19 13:42:15,728 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-19 13:42:15,729 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-19 13:42:15,729 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-19 13:42:15,729 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-19 13:42:15,730 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-19 13:42:15,730 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-19 13:42:15,730 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-19 13:42:15,730 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-19 13:42:15,731 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-19 13:42:15,731 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-19 13:42:15,731 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-19 13:42:15,731 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-19 13:42:15,732 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-19 13:42:15,732 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-19 13:42:15,732 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-19 13:42:15,733 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-19 13:42:15,733 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-19 13:42:15,733 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-19 13:42:15,733 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-19 13:42:15,734 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-19 13:42:15,734 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-19 13:42:15,734 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-19 13:42:15,735 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-19 13:42:15,735 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-19 13:42:15,735 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-19 13:42:15,735 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-19 13:42:15,736 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-19 13:42:15,736 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-19 13:42:15,736 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-19 13:42:15,737 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-19 13:42:15,737 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-19 13:42:15,737 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-19 13:42:15,737 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-19 13:42:15,738 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-19 13:42:15,738 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-19 13:42:15,738 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-19 13:42:15,739 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-19 13:42:15,739 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-19 13:42:15,739 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-19 13:42:15,740 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-19 13:42:15,740 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-19 13:42:15,740 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-19 13:42:15,740 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-19 13:42:15,741 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-19 13:42:15,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,748 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-19 13:42:15,748 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-19 13:42:15,749 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-19 13:42:15,749 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-19 13:42:15,749 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-19 13:42:15,750 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-19 13:42:15,750 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-19 13:42:15,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-19 13:42:15,751 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-19 13:42:15,754 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-19 13:42:15,809 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-19 13:42:15,820 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-19 13:42:15,820 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-19 13:42:15,838 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-19 13:42:15,856 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 105 transitions, 215 flow [2021-11-19 13:42:15,859 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 105 transitions, 215 flow [2021-11-19 13:42:15,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 105 transitions, 215 flow [2021-11-19 13:42:15,920 INFO L129 PetriNetUnfolder]: 6/104 cut-off events. [2021-11-19 13:42:15,920 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-19 13:42:15,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 104 events. 6/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2021-11-19 13:42:15,932 INFO L116 LiptonReduction]: Number of co-enabled transitions 3192 [2021-11-19 13:42:18,454 INFO L131 LiptonReduction]: Checked pairs total: 8073 [2021-11-19 13:42:18,454 INFO L133 LiptonReduction]: Total number of compositions: 67 [2021-11-19 13:42:18,478 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 41 transitions, 87 flow [2021-11-19 13:42:18,537 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 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-19 13:42:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 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-19 13:42:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-19 13:42:18,550 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:18,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:42:18,552 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2002366501, now seen corresponding path program 1 times [2021-11-19 13:42:18,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:18,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129087391] [2021-11-19 13:42:18,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:18,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:18,831 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-19 13:42:18,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:18,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129087391] [2021-11-19 13:42:18,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129087391] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:18,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:42:18,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-19 13:42:18,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980807611] [2021-11-19 13:42:18,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:18,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-19 13:42:18,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-19 13:42:18,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-19 13:42:18,884 INFO L87 Difference]: Start difference. First operand has 326 states, 318 states have (on average 2.0440251572327046) internal successors, (650), 325 states have internal predecessors, (650), 0 states have call successors, (0), 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-19 13:42:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:18,998 INFO L93 Difference]: Finished difference Result 327 states and 651 transitions. [2021-11-19 13:42:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-19 13:42:19,006 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-19 13:42:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:19,035 INFO L225 Difference]: With dead ends: 327 [2021-11-19 13:42:19,036 INFO L226 Difference]: Without dead ends: 327 [2021-11-19 13:42:19,038 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-19 13:42:19,045 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:19,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-19 13:42:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-19 13:42:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2021-11-19 13:42:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 319 states have (on average 2.040752351097179) internal successors, (651), 326 states have internal predecessors, (651), 0 states have call successors, (0), 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-19 13:42:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 651 transitions. [2021-11-19 13:42:19,175 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 651 transitions. Word has length 11 [2021-11-19 13:42:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:19,175 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 651 transitions. [2021-11-19 13:42:19,176 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-19 13:42:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 651 transitions. [2021-11-19 13:42:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-19 13:42:19,177 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:19,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:42:19,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-19 13:42:19,178 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 665729933, now seen corresponding path program 1 times [2021-11-19 13:42:19,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:19,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395309603] [2021-11-19 13:42:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:19,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:19,258 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-19 13:42:19,258 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:19,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395309603] [2021-11-19 13:42:19,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395309603] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:19,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494699080] [2021-11-19 13:42:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:19,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:19,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:19,261 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:19,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-19 13:42:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:19,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-19 13:42:19,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:19,458 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-19 13:42:19,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:19,529 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-19 13:42:19,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494699080] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:42:19,530 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2086782907] [2021-11-19 13:42:19,541 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-19 13:42:19,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:42:19,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2021-11-19 13:42:19,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745721969] [2021-11-19 13:42:19,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:42:19,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:42:19,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:42:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-19 13:42:19,553 INFO L87 Difference]: Start difference. First operand 327 states and 651 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-19 13:42:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:19,644 INFO L93 Difference]: Finished difference Result 330 states and 654 transitions. [2021-11-19 13:42:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:42:19,645 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-19 13:42:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:19,650 INFO L225 Difference]: With dead ends: 330 [2021-11-19 13:42:19,650 INFO L226 Difference]: Without dead ends: 330 [2021-11-19 13:42:19,651 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-19 13:42:19,658 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:19,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:42:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-19 13:42:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2021-11-19 13:42:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 322 states have (on average 2.031055900621118) internal successors, (654), 329 states have internal predecessors, (654), 0 states have call successors, (0), 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-19 13:42:19,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 654 transitions. [2021-11-19 13:42:19,702 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 654 transitions. Word has length 12 [2021-11-19 13:42:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:19,702 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 654 transitions. [2021-11-19 13:42:19,703 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-19 13:42:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 654 transitions. [2021-11-19 13:42:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 13:42:19,707 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:19,708 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:42:19,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-19 13:42:19,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:19,924 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash 768952869, now seen corresponding path program 2 times [2021-11-19 13:42:19,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:19,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388023473] [2021-11-19 13:42:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:19,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:20,054 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-19 13:42:20,054 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:20,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388023473] [2021-11-19 13:42:20,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388023473] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:20,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022999931] [2021-11-19 13:42:20,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:42:20,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:20,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:20,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:20,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-19 13:42:20,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 13:42:20,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:42:20,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-19 13:42:20,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:20,228 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-19 13:42:20,268 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-19 13:42:20,269 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-19 13:42:20,339 INFO L354 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2021-11-19 13:42:20,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-19 13:42:20,413 INFO L354 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2021-11-19 13:42:20,413 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-19 13:42:20,445 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-19 13:42:20,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:20,552 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-19 13:42:20,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022999931] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:20,552 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 13:42:20,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2021-11-19 13:42:20,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476746954] [2021-11-19 13:42:20,553 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:20,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 13:42:20,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 13:42:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-19 13:42:20,556 INFO L87 Difference]: Start difference. First operand 330 states and 654 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-19 13:42:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:20,906 INFO L93 Difference]: Finished difference Result 431 states and 856 transitions. [2021-11-19 13:42:20,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:42:20,912 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-19 13:42:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:20,916 INFO L225 Difference]: With dead ends: 431 [2021-11-19 13:42:20,916 INFO L226 Difference]: Without dead ends: 431 [2021-11-19 13:42:20,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-19 13:42:20,918 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:20,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 27 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 13:42:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-19 13:42:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 397. [2021-11-19 13:42:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 389 states have (on average 2.025706940874036) internal successors, (788), 396 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-19 13:42:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 788 transitions. [2021-11-19 13:42:20,937 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 788 transitions. Word has length 15 [2021-11-19 13:42:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:20,937 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 788 transitions. [2021-11-19 13:42:20,937 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-19 13:42:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 788 transitions. [2021-11-19 13:42:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-19 13:42:20,939 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:20,939 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:42:20,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-19 13:42:21,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:21,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:21,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1292558801, now seen corresponding path program 1 times [2021-11-19 13:42:21,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:21,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483484423] [2021-11-19 13:42:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:21,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:21,307 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-19 13:42:21,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:21,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483484423] [2021-11-19 13:42:21,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483484423] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:21,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012849022] [2021-11-19 13:42:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:21,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:21,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:21,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-19 13:42:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:21,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-19 13:42:21,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:21,427 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-19 13:42:21,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:21,508 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-19 13:42:21,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012849022] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:42:21,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791846873] [2021-11-19 13:42:21,509 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-19 13:42:21,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:42:21,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-19 13:42:21,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940424538] [2021-11-19 13:42:21,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:42:21,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-19 13:42:21,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-19 13:42:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-19 13:42:21,513 INFO L87 Difference]: Start difference. First operand 397 states and 788 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-19 13:42:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:21,601 INFO L93 Difference]: Finished difference Result 403 states and 794 transitions. [2021-11-19 13:42:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-19 13:42:21,602 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-19 13:42:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:21,605 INFO L225 Difference]: With dead ends: 403 [2021-11-19 13:42:21,605 INFO L226 Difference]: Without dead ends: 403 [2021-11-19 13:42:21,605 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-19 13:42:21,607 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:21,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:42:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-19 13:42:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2021-11-19 13:42:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 395 states have (on average 2.010126582278481) internal successors, (794), 402 states have internal predecessors, (794), 0 states have call successors, (0), 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-19 13:42:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 794 transitions. [2021-11-19 13:42:21,624 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 794 transitions. Word has length 15 [2021-11-19 13:42:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:21,624 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 794 transitions. [2021-11-19 13:42:21,624 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-19 13:42:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 794 transitions. [2021-11-19 13:42:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-19 13:42:21,626 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:21,626 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-19 13:42:21,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-19 13:42:21,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:21,854 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash 988292399, now seen corresponding path program 2 times [2021-11-19 13:42:21,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:21,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115319329] [2021-11-19 13:42:21,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:21,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:22,041 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-19 13:42:22,041 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:22,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115319329] [2021-11-19 13:42:22,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115319329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:22,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:42:22,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 13:42:22,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862438526] [2021-11-19 13:42:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:22,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 13:42:22,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:22,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 13:42:22,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-19 13:42:22,044 INFO L87 Difference]: Start difference. First operand 403 states and 794 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-19 13:42:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:22,448 INFO L93 Difference]: Finished difference Result 493 states and 974 transitions. [2021-11-19 13:42:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:42:22,449 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-19 13:42:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:22,453 INFO L225 Difference]: With dead ends: 493 [2021-11-19 13:42:22,454 INFO L226 Difference]: Without dead ends: 493 [2021-11-19 13:42:22,454 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-19 13:42:22,455 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:22,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 17 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-19 13:42:22,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-11-19 13:42:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 461. [2021-11-19 13:42:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 454 states have (on average 2.004405286343612) internal successors, (910), 460 states have internal predecessors, (910), 0 states have call successors, (0), 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-19 13:42:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 910 transitions. [2021-11-19 13:42:22,483 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 910 transitions. Word has length 21 [2021-11-19 13:42:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:22,485 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 910 transitions. [2021-11-19 13:42:22,485 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-19 13:42:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 910 transitions. [2021-11-19 13:42:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 13:42:22,493 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:22,494 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-19 13:42:22,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-19 13:42:22,494 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash 108033755, now seen corresponding path program 1 times [2021-11-19 13:42:22,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:22,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644059370] [2021-11-19 13:42:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:22,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:22,647 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-19 13:42:22,647 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:22,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644059370] [2021-11-19 13:42:22,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644059370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:22,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:42:22,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 13:42:22,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977773449] [2021-11-19 13:42:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:22,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 13:42:22,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:22,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 13:42:22,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-19 13:42:22,649 INFO L87 Difference]: Start difference. First operand 461 states and 910 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-19 13:42:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:22,900 INFO L93 Difference]: Finished difference Result 527 states and 1042 transitions. [2021-11-19 13:42:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:42:22,901 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-19 13:42:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:22,905 INFO L225 Difference]: With dead ends: 527 [2021-11-19 13:42:22,906 INFO L226 Difference]: Without dead ends: 512 [2021-11-19 13:42:22,906 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-19 13:42:22,907 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:22,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 26 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 13:42:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-11-19 13:42:22,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2021-11-19 13:42:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 505 states have (on average 2.0) internal successors, (1010), 511 states have internal predecessors, (1010), 0 states have call successors, (0), 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-19 13:42:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1010 transitions. [2021-11-19 13:42:22,929 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1010 transitions. Word has length 27 [2021-11-19 13:42:22,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:22,930 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 1010 transitions. [2021-11-19 13:42:22,930 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-19 13:42:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1010 transitions. [2021-11-19 13:42:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-19 13:42:22,931 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:22,931 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-19 13:42:22,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-19 13:42:22,932 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:22,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1638396953, now seen corresponding path program 1 times [2021-11-19 13:42:22,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:22,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238493516] [2021-11-19 13:42:22,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:22,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:23,046 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-19 13:42:23,047 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:23,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238493516] [2021-11-19 13:42:23,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238493516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:23,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-19 13:42:23,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-19 13:42:23,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285910424] [2021-11-19 13:42:23,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:23,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-19 13:42:23,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:23,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-19 13:42:23,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-19 13:42:23,050 INFO L87 Difference]: Start difference. First operand 512 states and 1010 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-19 13:42:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:23,354 INFO L93 Difference]: Finished difference Result 600 states and 1186 transitions. [2021-11-19 13:42:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-19 13:42:23,355 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-19 13:42:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:23,360 INFO L225 Difference]: With dead ends: 600 [2021-11-19 13:42:23,360 INFO L226 Difference]: Without dead ends: 584 [2021-11-19 13:42:23,361 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-19 13:42:23,362 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:23,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 18 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-19 13:42:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-11-19 13:42:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 562. [2021-11-19 13:42:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 555 states have (on average 1.9963963963963964) internal successors, (1108), 561 states have internal predecessors, (1108), 0 states have call successors, (0), 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-19 13:42:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1108 transitions. [2021-11-19 13:42:23,385 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1108 transitions. Word has length 27 [2021-11-19 13:42:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:23,385 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1108 transitions. [2021-11-19 13:42:23,386 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-19 13:42:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1108 transitions. [2021-11-19 13:42:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 13:42:23,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:23,387 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-19 13:42:23,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-19 13:42:23,388 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 168946029, now seen corresponding path program 1 times [2021-11-19 13:42:23,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:23,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900405834] [2021-11-19 13:42:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:23,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:23,662 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-19 13:42:23,663 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:23,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900405834] [2021-11-19 13:42:23,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900405834] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:23,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149235605] [2021-11-19 13:42:23,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:23,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:23,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:23,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:23,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-19 13:42:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:23,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-19 13:42:23,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:23,843 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-19 13:42:23,931 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-19 13:42:23,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:24,001 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 18 treesize of output 16 [2021-11-19 13:42:24,006 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 19 treesize of output 15 [2021-11-19 13:42:24,039 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-19 13:42:24,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149235605] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:24,039 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 13:42:24,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 12 [2021-11-19 13:42:24,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999905113] [2021-11-19 13:42:24,041 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:24,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 13:42:24,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:24,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 13:42:24,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-19 13:42:24,043 INFO L87 Difference]: Start difference. First operand 562 states and 1108 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-19 13:42:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:24,307 INFO L93 Difference]: Finished difference Result 1771 states and 3511 transitions. [2021-11-19 13:42:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-19 13:42:24,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-19 13:42:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:24,327 INFO L225 Difference]: With dead ends: 1771 [2021-11-19 13:42:24,328 INFO L226 Difference]: Without dead ends: 1771 [2021-11-19 13:42:24,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2021-11-19 13:42:24,330 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 185 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:24,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 297 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 13:42:24,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2021-11-19 13:42:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 589. [2021-11-19 13:42:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 582 states have (on average 1.9742268041237114) internal successors, (1149), 588 states have internal predecessors, (1149), 0 states have call successors, (0), 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-19 13:42:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1149 transitions. [2021-11-19 13:42:24,372 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1149 transitions. Word has length 31 [2021-11-19 13:42:24,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:24,375 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 1149 transitions. [2021-11-19 13:42:24,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 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-19 13:42:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1149 transitions. [2021-11-19 13:42:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 13:42:24,379 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:24,379 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-19 13:42:24,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-19 13:42:24,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-19 13:42:24,594 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:24,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1631758317, now seen corresponding path program 2 times [2021-11-19 13:42:24,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:24,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402193305] [2021-11-19 13:42:24,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:24,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:24,782 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-19 13:42:24,783 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:24,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402193305] [2021-11-19 13:42:24,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402193305] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:24,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339838239] [2021-11-19 13:42:24,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:42:24,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:24,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:24,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:24,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-19 13:42:24,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-19 13:42:24,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:42:24,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-19 13:42:24,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:24,979 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-19 13:42:25,032 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-19 13:42:25,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:25,087 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-19 13:42:25,090 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 25 treesize of output 18 [2021-11-19 13:42:25,129 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-19 13:42:25,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339838239] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:25,130 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 13:42:25,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 12 [2021-11-19 13:42:25,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319510526] [2021-11-19 13:42:25,131 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:25,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-19 13:42:25,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-19 13:42:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-11-19 13:42:25,132 INFO L87 Difference]: Start difference. First operand 589 states and 1149 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-19 13:42:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:25,308 INFO L93 Difference]: Finished difference Result 1798 states and 3539 transitions. [2021-11-19 13:42:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-19 13:42:25,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-19 13:42:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:25,324 INFO L225 Difference]: With dead ends: 1798 [2021-11-19 13:42:25,325 INFO L226 Difference]: Without dead ends: 1798 [2021-11-19 13:42:25,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-19 13:42:25,326 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 129 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:25,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 224 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-19 13:42:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2021-11-19 13:42:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 603. [2021-11-19 13:42:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 596 states have (on average 1.9530201342281879) internal successors, (1164), 602 states have internal predecessors, (1164), 0 states have call successors, (0), 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-19 13:42:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1164 transitions. [2021-11-19 13:42:25,367 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1164 transitions. Word has length 31 [2021-11-19 13:42:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:25,367 INFO L470 AbstractCegarLoop]: Abstraction has 603 states and 1164 transitions. [2021-11-19 13:42:25,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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-19 13:42:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1164 transitions. [2021-11-19 13:42:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 13:42:25,369 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:25,369 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-19 13:42:25,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-19 13:42:25,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-19 13:42:25,588 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:25,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash 8571101, now seen corresponding path program 3 times [2021-11-19 13:42:25,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:25,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330166759] [2021-11-19 13:42:25,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:25,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:25,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-19 13:42:25,776 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:25,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330166759] [2021-11-19 13:42:25,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330166759] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:25,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920086037] [2021-11-19 13:42:25,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:42:25,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:25,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:25,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:25,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-19 13:42:25,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:42:25,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:42:25,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-19 13:42:25,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:25,971 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-19 13:42:26,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:26,021 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-11-19 13:42:26,049 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-19 13:42:26,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:26,416 INFO L354 Elim1Store]: treesize reduction 85, result has 29.2 percent of original size [2021-11-19 13:42:26,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 72 [2021-11-19 13:42:26,436 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:42:26,436 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 64 treesize of output 64 [2021-11-19 13:42:26,448 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:42:26,448 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 60 treesize of output 60 [2021-11-19 13:42:26,460 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-19 13:42:26,461 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 68 treesize of output 62 [2021-11-19 13:42:26,471 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-19 13:42:26,472 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 60 treesize of output 54 [2021-11-19 13:42:26,476 INFO L883 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-11-19 13:42:26,624 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-19 13:42:26,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920086037] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:26,624 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 13:42:26,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 10] imperfect sequences [6] total 16 [2021-11-19 13:42:26,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642091795] [2021-11-19 13:42:26,625 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:26,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-19 13:42:26,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:26,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-19 13:42:26,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-11-19 13:42:26,627 INFO L87 Difference]: Start difference. First operand 603 states and 1164 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 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-19 13:42:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:31,070 INFO L93 Difference]: Finished difference Result 2863 states and 5658 transitions. [2021-11-19 13:42:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-19 13:42:31,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 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-19 13:42:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:31,096 INFO L225 Difference]: With dead ends: 2863 [2021-11-19 13:42:31,096 INFO L226 Difference]: Without dead ends: 2863 [2021-11-19 13:42:31,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 60 SyntacticMatches, 22 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=697, Invalid=2383, Unknown=0, NotChecked=0, Total=3080 [2021-11-19 13:42:31,099 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 617 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:31,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 62 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1378 Invalid, 0 Unknown, 219 Unchecked, 2.0s Time] [2021-11-19 13:42:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2021-11-19 13:42:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 814. [2021-11-19 13:42:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 807 states have (on average 1.9987608426270136) internal successors, (1613), 813 states have internal predecessors, (1613), 0 states have call successors, (0), 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-19 13:42:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1613 transitions. [2021-11-19 13:42:31,192 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1613 transitions. Word has length 31 [2021-11-19 13:42:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:31,193 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1613 transitions. [2021-11-19 13:42:31,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 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-19 13:42:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1613 transitions. [2021-11-19 13:42:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-19 13:42:31,195 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:31,195 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-19 13:42:31,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-19 13:42:31,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:31,410 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:31,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2009514885, now seen corresponding path program 4 times [2021-11-19 13:42:31,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:31,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512110342] [2021-11-19 13:42:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:31,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:31,680 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-19 13:42:31,680 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:31,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512110342] [2021-11-19 13:42:31,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512110342] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:31,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905349799] [2021-11-19 13:42:31,681 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 13:42:31,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:31,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:31,683 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:31,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-19 13:42:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:31,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-19 13:42:31,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:31,847 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-19 13:42:31,906 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-19 13:42:31,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:31,969 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-19 13:42:31,972 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 25 treesize of output 18 [2021-11-19 13:42:32,029 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-19 13:42:32,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905349799] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-19 13:42:32,029 INFO L186 FreeRefinementEngine]: Found 2 perfect and 1 imperfect interpolant sequences. [2021-11-19 13:42:32,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 11 [2021-11-19 13:42:32,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758811321] [2021-11-19 13:42:32,030 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-19 13:42:32,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-19 13:42:32,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-19 13:42:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-19 13:42:32,034 INFO L87 Difference]: Start difference. First operand 814 states and 1613 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-19 13:42:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:42:32,250 INFO L93 Difference]: Finished difference Result 1897 states and 3711 transitions. [2021-11-19 13:42:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-19 13:42:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-19 13:42:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:42:32,267 INFO L225 Difference]: With dead ends: 1897 [2021-11-19 13:42:32,268 INFO L226 Difference]: Without dead ends: 1897 [2021-11-19 13:42:32,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-19 13:42:32,269 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 296 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:42:32,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 172 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-19 13:42:32,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2021-11-19 13:42:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 650. [2021-11-19 13:42:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 643 states have (on average 1.9564541213063764) internal successors, (1258), 649 states have internal predecessors, (1258), 0 states have call successors, (0), 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-19 13:42:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1258 transitions. [2021-11-19 13:42:32,314 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1258 transitions. Word has length 31 [2021-11-19 13:42:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:42:32,314 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 1258 transitions. [2021-11-19 13:42:32,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-19 13:42:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1258 transitions. [2021-11-19 13:42:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:42:32,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:42:32,321 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-19 13:42:32,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-19 13:42:32,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:32,546 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:42:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:42:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1608805789, now seen corresponding path program 1 times [2021-11-19 13:42:32,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:42:32,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160135303] [2021-11-19 13:42:32,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:32,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:42:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:33,149 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-19 13:42:33,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:42:33,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160135303] [2021-11-19 13:42:33,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160135303] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:42:33,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651822444] [2021-11-19 13:42:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:42:33,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:42:33,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:42:33,152 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:42:33,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-19 13:42:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:42:33,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-19 13:42:33,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:42:33,601 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-19 13:42:33,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,656 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-19 13:42:33,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,768 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-19 13:42:33,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,852 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-19 13:42:33,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:42:33,958 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 48 treesize of output 56 [2021-11-19 13:42:34,141 INFO L354 Elim1Store]: treesize reduction 328, result has 13.2 percent of original size [2021-11-19 13:42:34,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 77 treesize of output 88 [2021-11-19 13:42:40,055 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-19 13:42:40,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:42:41,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:42:41,854 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-19 13:42:41,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651822444] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:42:41,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [872478217] [2021-11-19 13:42:41,855 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-19 13:42:41,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:42:41,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2021-11-19 13:42:41,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168177008] [2021-11-19 13:42:41,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:42:41,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-19 13:42:41,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:42:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-19 13:42:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=805, Unknown=3, NotChecked=0, Total=992 [2021-11-19 13:42:41,859 INFO L87 Difference]: Start difference. First operand 650 states and 1258 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 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-19 13:43:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:43:31,307 INFO L93 Difference]: Finished difference Result 6105 states and 12114 transitions. [2021-11-19 13:43:31,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-19 13:43:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 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-19 13:43:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:43:31,346 INFO L225 Difference]: With dead ends: 6105 [2021-11-19 13:43:31,346 INFO L226 Difference]: Without dead ends: 6097 [2021-11-19 13:43:31,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=2232, Invalid=7242, Unknown=32, NotChecked=0, Total=9506 [2021-11-19 13:43:31,349 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 832 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 4752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1479 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-19 13:43:31,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [832 Valid, 356 Invalid, 4752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2877 Invalid, 0 Unknown, 1479 Unchecked, 3.2s Time] [2021-11-19 13:43:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6097 states. [2021-11-19 13:43:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6097 to 1815. [2021-11-19 13:43:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1808 states have (on average 2.0890486725663715) internal successors, (3777), 1814 states have internal predecessors, (3777), 0 states have call successors, (0), 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-19 13:43:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 3777 transitions. [2021-11-19 13:43:31,486 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 3777 transitions. Word has length 45 [2021-11-19 13:43:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:43:31,487 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 3777 transitions. [2021-11-19 13:43:31,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 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-19 13:43:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3777 transitions. [2021-11-19 13:43:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:43:31,490 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:43:31,490 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-19 13:43:31,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-19 13:43:31,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-19 13:43:31,706 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:43:31,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:43:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1317952403, now seen corresponding path program 1 times [2021-11-19 13:43:31,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:43:31,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303859307] [2021-11-19 13:43:31,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:43:31,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:43:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:43:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-11-19 13:43:32,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:43:32,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303859307] [2021-11-19 13:43:32,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303859307] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:43:32,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887908097] [2021-11-19 13:43:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:43:32,507 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:43:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:43:32,514 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:43:32,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-19 13:43:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:43:32,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-19 13:43:32,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:43:32,914 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-19 13:43:32,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:32,958 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-19 13:43:33,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,021 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-19 13:43:33,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,091 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-19 13:43:33,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,180 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-19 13:43:33,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,319 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-19 13:43:33,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,408 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-19 13:43:33,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,530 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-19 13:43:33,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:43:33,827 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-19 13:43:33,828 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 35 case distinctions, treesize of input 106 treesize of output 115 [2021-11-19 13:43:44,000 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-19 13:43:44,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:43:46,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:46,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:43:47,036 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-19 13:43:47,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887908097] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:43:47,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [831442152] [2021-11-19 13:43:47,037 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-19 13:43:47,037 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:43:47,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-19 13:43:47,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959738806] [2021-11-19 13:43:47,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:43:47,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-19 13:43:47,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:43:47,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-19 13:43:47,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1274, Unknown=4, NotChecked=0, Total=1560 [2021-11-19 13:43:47,039 INFO L87 Difference]: Start difference. First operand 1815 states and 3777 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-19 13:44:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:44:00,756 INFO L93 Difference]: Finished difference Result 3750 states and 7421 transitions. [2021-11-19 13:44:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-19 13:44:00,757 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-19 13:44:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:44:00,782 INFO L225 Difference]: With dead ends: 3750 [2021-11-19 13:44:00,782 INFO L226 Difference]: Without dead ends: 3744 [2021-11-19 13:44:00,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=1084, Invalid=3599, Unknown=9, NotChecked=0, Total=4692 [2021-11-19 13:44:00,785 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 616 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1634 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-19 13:44:00,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 345 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2003 Invalid, 0 Unknown, 1634 Unchecked, 1.9s Time] [2021-11-19 13:44:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2021-11-19 13:44:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 1976. [2021-11-19 13:44:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1969 states have (on average 2.083798882681564) internal successors, (4103), 1975 states have internal predecessors, (4103), 0 states have call successors, (0), 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-19 13:44:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 4103 transitions. [2021-11-19 13:44:00,889 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 4103 transitions. Word has length 45 [2021-11-19 13:44:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:44:00,889 INFO L470 AbstractCegarLoop]: Abstraction has 1976 states and 4103 transitions. [2021-11-19 13:44:00,890 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-19 13:44:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 4103 transitions. [2021-11-19 13:44:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:44:00,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:44:00,893 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-19 13:44:00,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-19 13:44:01,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-19 13:44:01,106 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:44:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:44:01,107 INFO L85 PathProgramCache]: Analyzing trace with hash 269135871, now seen corresponding path program 1 times [2021-11-19 13:44:01,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:44:01,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364346051] [2021-11-19 13:44:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:44:01,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:44:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:44:01,387 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-19 13:44:01,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:44:01,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364346051] [2021-11-19 13:44:01,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364346051] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:44:01,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730124879] [2021-11-19 13:44:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:44:01,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:44:01,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:44:01,390 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:44:01,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-19 13:44:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:44:01,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 13:44:01,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:44:01,813 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-19 13:44:01,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:01,860 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-19 13:44:01,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:01,944 INFO L354 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2021-11-19 13:44:01,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 43 [2021-11-19 13:44:02,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,052 INFO L354 Elim1Store]: treesize reduction 59, result has 15.7 percent of original size [2021-11-19 13:44:02,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 55 [2021-11-19 13:44:02,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:02,170 INFO L354 Elim1Store]: treesize reduction 73, result has 13.1 percent of original size [2021-11-19 13:44:02,171 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 7 case distinctions, treesize of input 59 treesize of output 67 [2021-11-19 13:44:02,246 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-19 13:44:02,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:44:02,397 INFO L354 Elim1Store]: treesize reduction 85, result has 24.1 percent of original size [2021-11-19 13:44:02,397 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 41 [2021-11-19 13:44:02,402 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:44:02,403 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 41 treesize of output 37 [2021-11-19 13:44:02,411 INFO L354 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2021-11-19 13:44:02,412 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 42 treesize of output 38 [2021-11-19 13:44:02,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:02,443 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-19 13:44:02,443 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-19 13:44:02,446 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 41 treesize of output 33 [2021-11-19 13:44:02,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:02,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:02,450 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 24 treesize of output 16 [2021-11-19 13:44:02,767 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-19 13:44:02,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730124879] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:44:02,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227288609] [2021-11-19 13:44:02,768 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-19 13:44:02,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:44:02,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-19 13:44:02,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085060038] [2021-11-19 13:44:02,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:44:02,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-19 13:44:02,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:44:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-19 13:44:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2021-11-19 13:44:02,770 INFO L87 Difference]: Start difference. First operand 1976 states and 4103 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-19 13:44:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:44:06,616 INFO L93 Difference]: Finished difference Result 4240 states and 8402 transitions. [2021-11-19 13:44:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-19 13:44:06,617 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-19 13:44:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:44:06,634 INFO L225 Difference]: With dead ends: 4240 [2021-11-19 13:44:06,634 INFO L226 Difference]: Without dead ends: 4236 [2021-11-19 13:44:06,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1663 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1098, Invalid=4304, Unknown=0, NotChecked=0, Total=5402 [2021-11-19 13:44:06,637 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 752 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:44:06,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 302 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2714 Invalid, 0 Unknown, 144 Unchecked, 2.3s Time] [2021-11-19 13:44:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2021-11-19 13:44:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 2488. [2021-11-19 13:44:06,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2481 states have (on average 2.101168883514712) internal successors, (5213), 2487 states have internal predecessors, (5213), 0 states have call successors, (0), 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-19 13:44:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 5213 transitions. [2021-11-19 13:44:06,732 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 5213 transitions. Word has length 45 [2021-11-19 13:44:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:44:06,732 INFO L470 AbstractCegarLoop]: Abstraction has 2488 states and 5213 transitions. [2021-11-19 13:44:06,733 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-19 13:44:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 5213 transitions. [2021-11-19 13:44:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:44:06,736 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:44:06,737 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-19 13:44:06,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-19 13:44:06,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:44:06,962 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:44:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:44:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1160834905, now seen corresponding path program 2 times [2021-11-19 13:44:06,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:44:06,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173190055] [2021-11-19 13:44:06,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:44:06,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:44:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:44:07,733 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-19 13:44:07,733 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:44:07,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173190055] [2021-11-19 13:44:07,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173190055] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:44:07,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914114262] [2021-11-19 13:44:07,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:44:07,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:44:07,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:44:07,741 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:44:07,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-19 13:44:07,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 13:44:07,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:44:07,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-19 13:44:07,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:44:08,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-19 13:44:08,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,166 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-19 13:44:08,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,221 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-19 13:44:08,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,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 37 treesize of output 42 [2021-11-19 13:44:08,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,412 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-19 13:44:08,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,510 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-19 13:44:08,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,664 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-19 13:44:08,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:08,855 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-19 13:44:09,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:09,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:09,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:09,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:09,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:09,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:09,205 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-19 13:44:09,206 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 35 case distinctions, treesize of input 106 treesize of output 115 [2021-11-19 13:44:19,350 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-19 13:44:19,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:44:22,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:44:22,767 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-19 13:44:22,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914114262] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:44:22,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [141847153] [2021-11-19 13:44:22,768 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-19 13:44:22,769 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:44:22,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-19 13:44:22,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122989281] [2021-11-19 13:44:22,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:44:22,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-19 13:44:22,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:44:22,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-19 13:44:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1278, Unknown=4, NotChecked=0, Total=1560 [2021-11-19 13:44:22,771 INFO L87 Difference]: Start difference. First operand 2488 states and 5213 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-19 13:44:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:44:49,260 INFO L93 Difference]: Finished difference Result 5255 states and 10554 transitions. [2021-11-19 13:44:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-19 13:44:49,261 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-19 13:44:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:44:49,279 INFO L225 Difference]: With dead ends: 5255 [2021-11-19 13:44:49,280 INFO L226 Difference]: Without dead ends: 5255 [2021-11-19 13:44:49,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=1215, Invalid=4173, Unknown=14, NotChecked=0, Total=5402 [2021-11-19 13:44:49,283 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 661 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 13:44:49,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 366 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 770 Invalid, 0 Unknown, 212 Unchecked, 0.6s Time] [2021-11-19 13:44:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2021-11-19 13:44:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 2502. [2021-11-19 13:44:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2502 states, 2495 states have (on average 2.1006012024048095) internal successors, (5241), 2501 states have internal predecessors, (5241), 0 states have call successors, (0), 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-19 13:44:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 2502 states and 5241 transitions. [2021-11-19 13:44:49,434 INFO L78 Accepts]: Start accepts. Automaton has 2502 states and 5241 transitions. Word has length 45 [2021-11-19 13:44:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:44:49,435 INFO L470 AbstractCegarLoop]: Abstraction has 2502 states and 5241 transitions. [2021-11-19 13:44:49,435 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-19 13:44:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 5241 transitions. [2021-11-19 13:44:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:44:49,440 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:44:49,440 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-19 13:44:49,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-19 13:44:49,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-19 13:44:49,654 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:44:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:44:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1679638163, now seen corresponding path program 3 times [2021-11-19 13:44:49,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:44:49,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579380048] [2021-11-19 13:44:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:44:49,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:44:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:44:50,374 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-19 13:44:50,374 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:44:50,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579380048] [2021-11-19 13:44:50,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579380048] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:44:50,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203559331] [2021-11-19 13:44:50,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:44:50,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:44:50,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:44:50,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:44:50,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-19 13:44:50,662 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:44:50,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:44:50,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-19 13:44:50,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:44:50,915 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-19 13:44:50,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:50,949 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-19 13:44:50,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:50,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:50,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:50,992 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:44:50,992 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 28 treesize of output 30 [2021-11-19 13:44:51,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,050 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:44:51,050 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 37 treesize of output 42 [2021-11-19 13:44:51,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,120 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:44:51,121 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 6 case distinctions, treesize of input 46 treesize of output 54 [2021-11-19 13:44:51,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,234 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:44:51,234 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 10 case distinctions, treesize of input 55 treesize of output 66 [2021-11-19 13:44:51,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,344 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:44:51,345 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 15 case distinctions, treesize of input 64 treesize of output 78 [2021-11-19 13:44:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:44:51,645 INFO L354 Elim1Store]: treesize reduction 547, result has 10.2 percent of original size [2021-11-19 13:44:51,645 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 27 case distinctions, treesize of input 97 treesize of output 103 [2021-11-19 13:45:01,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:45:01,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:45:01,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:45:01,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:45:01,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:45:01,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:45:01,902 INFO L354 Elim1Store]: treesize reduction 348, result has 9.6 percent of original size [2021-11-19 13:45:01,903 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 18 case distinctions, treesize of input 84 treesize of output 98 [2021-11-19 13:45:04,068 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-19 13:45:04,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:45:07,326 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (store (select (let ((.cse0 (let ((.cse1 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse2 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse2)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (store (select (let ((.cse3 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse3 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (let ((.cse6 (let ((.cse7 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |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))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse6 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) is different from false [2021-11-19 13:45:07,577 INFO L354 Elim1Store]: treesize reduction 1027, result has 6.1 percent of original size [2021-11-19 13:45:07,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 1 new quantified variables, introduced 7 case distinctions, treesize of input 163 treesize of output 81 [2021-11-19 13:45:07,580 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 69 treesize of output 57 [2021-11-19 13:45:07,593 INFO L354 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2021-11-19 13:45:07,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 46 [2021-11-19 13:45:07,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,756 INFO L354 Elim1Store]: treesize reduction 593, result has 7.3 percent of original size [2021-11-19 13:45:07,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 161 treesize of output 59 [2021-11-19 13:45:07,762 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 47 treesize of output 39 [2021-11-19 13:45:07,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,773 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-19 13:45:07,773 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 4 case distinctions, treesize of input 34 treesize of output 20 [2021-11-19 13:45:07,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,789 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,925 INFO L354 Elim1Store]: treesize reduction 342, result has 14.7 percent of original size [2021-11-19 13:45:07,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 163 treesize of output 73 [2021-11-19 13:45:07,931 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 59 treesize of output 49 [2021-11-19 13:45:07,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:45:07,949 INFO L354 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2021-11-19 13:45:07,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 26 [2021-11-19 13:45:08,286 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-19 13:45:08,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203559331] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:45:08,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [585464372] [2021-11-19 13:45:08,287 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-19 13:45:08,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:45:08,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2021-11-19 13:45:08,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931559206] [2021-11-19 13:45:08,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:45:08,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 13:45:08,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:45:08,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 13:45:08,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1195, Unknown=5, NotChecked=72, Total=1482 [2021-11-19 13:45:08,291 INFO L87 Difference]: Start difference. First operand 2502 states and 5241 transitions. Second operand has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 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-19 13:45:10,964 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| 3))) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse2 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (store (select (let ((.cse0 (let ((.cse1 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse2 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse0 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse2)) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.offset| 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (store (select (let ((.cse3 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse3 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse5)) 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.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_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (let ((.cse6 (let ((.cse7 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse7 |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))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse6 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0))) is different from false [2021-11-19 13:46:47,986 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (store (select (let ((.cse1 (let ((.cse2 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse3 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse3)) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (< (+ 2 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.offset| 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (< 0 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (store (select (let ((.cse4 (let ((.cse5 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse4 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse6)) 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_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse7 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2021-11-19 13:46:53,803 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 28 |c_t_funThread1of1ForFork0_~i~0#1|))) (and (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse3 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (store (select (let ((.cse1 (let ((.cse2 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse3 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse1 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse3)) 0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (< (+ 2 (* 28 |c_ULTIMATE.start_main_~i~2#1|)) .cse0) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse6 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (store (select (let ((.cse4 (let ((.cse5 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse5 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse6 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse4 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse4 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) .cse6)) 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_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (store (select (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select .cse7 |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| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_118|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)))) is different from false [2021-11-19 13:46:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:46:54,652 INFO L93 Difference]: Finished difference Result 13672 states and 27984 transitions. [2021-11-19 13:46:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-11-19 13:46:54,653 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 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-19 13:46:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:46:54,706 INFO L225 Difference]: With dead ends: 13672 [2021-11-19 13:46:54,706 INFO L226 Difference]: Without dead ends: 13661 [2021-11-19 13:46:54,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 104 SyntacticMatches, 39 SemanticMatches, 142 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 9130 ImplicationChecksByTransitivity, 117.7s TimeCoverageRelationStatistics Valid=3073, Invalid=16368, Unknown=35, NotChecked=1116, Total=20592 [2021-11-19 13:46:54,715 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 1168 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 8779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2966 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-19 13:46:54,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1168 Valid, 451 Invalid, 8779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 5518 Invalid, 0 Unknown, 2966 Unchecked, 4.4s Time] [2021-11-19 13:46:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13661 states. [2021-11-19 13:46:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13661 to 4502. [2021-11-19 13:46:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4502 states, 4495 states have (on average 2.1268075639599555) internal successors, (9560), 4501 states have internal predecessors, (9560), 0 states have call successors, (0), 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-19 13:46:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 9560 transitions. [2021-11-19 13:46:55,049 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 9560 transitions. Word has length 45 [2021-11-19 13:46:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:46:55,049 INFO L470 AbstractCegarLoop]: Abstraction has 4502 states and 9560 transitions. [2021-11-19 13:46:55,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 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-19 13:46:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 9560 transitions. [2021-11-19 13:46:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:46:55,054 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:46:55,054 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-19 13:46:55,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-19 13:46:55,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-19 13:46:55,276 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:46:55,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:46:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1120008077, now seen corresponding path program 4 times [2021-11-19 13:46:55,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:46:55,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767046850] [2021-11-19 13:46:55,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:46:55,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:46:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:46:56,387 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-19 13:46:56,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:46:56,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767046850] [2021-11-19 13:46:56,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767046850] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:46:56,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260158595] [2021-11-19 13:46:56,388 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 13:46:56,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:46:56,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:46:56,389 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:46:56,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-19 13:46:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:46:56,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 13:46:56,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:46:56,854 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-19 13:46:56,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:56,920 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-19 13:46:56,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:56,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,004 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-19 13:46:57,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,110 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-19 13:46:57,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,220 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 48 treesize of output 56 [2021-11-19 13:46:57,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,352 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 57 treesize of output 68 [2021-11-19 13:46:57,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,512 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 66 treesize of output 80 [2021-11-19 13:46:57,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:46:57,800 INFO L354 Elim1Store]: treesize reduction 459, result has 13.4 percent of original size [2021-11-19 13:46:57,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 112 [2021-11-19 13:47:07,952 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-19 13:47:07,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:47:10,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:10,696 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-19 13:47:10,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260158595] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:47:10,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1174247287] [2021-11-19 13:47:10,697 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-19 13:47:10,698 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:47:10,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 38 [2021-11-19 13:47:10,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355452861] [2021-11-19 13:47:10,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:47:10,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 13:47:10,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:47:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 13:47:10,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1214, Unknown=4, NotChecked=0, Total=1482 [2021-11-19 13:47:10,700 INFO L87 Difference]: Start difference. First operand 4502 states and 9560 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-19 13:47:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:47:31,223 INFO L93 Difference]: Finished difference Result 9361 states and 19242 transitions. [2021-11-19 13:47:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-19 13:47:31,223 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-19 13:47:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:47:31,248 INFO L225 Difference]: With dead ends: 9361 [2021-11-19 13:47:31,248 INFO L226 Difference]: Without dead ends: 9354 [2021-11-19 13:47:31,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=1130, Invalid=4410, Unknown=10, NotChecked=0, Total=5550 [2021-11-19 13:47:31,251 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 1152 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1123 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:47:31,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 281 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2389 Invalid, 0 Unknown, 1123 Unchecked, 2.0s Time] [2021-11-19 13:47:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9354 states. [2021-11-19 13:47:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9354 to 4765. [2021-11-19 13:47:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4765 states, 4758 states have (on average 2.1218999579655318) internal successors, (10096), 4764 states have internal predecessors, (10096), 0 states have call successors, (0), 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-19 13:47:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 10096 transitions. [2021-11-19 13:47:31,461 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 10096 transitions. Word has length 45 [2021-11-19 13:47:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:47:31,461 INFO L470 AbstractCegarLoop]: Abstraction has 4765 states and 10096 transitions. [2021-11-19 13:47:31,462 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-19 13:47:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 10096 transitions. [2021-11-19 13:47:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:47:31,466 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:47:31,466 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-19 13:47:31,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-19 13:47:31,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-19 13:47:31,686 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:47:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:47:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2070432097, now seen corresponding path program 5 times [2021-11-19 13:47:31,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:47:31,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9358647] [2021-11-19 13:47:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:47:31,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:47:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:47:32,135 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-19 13:47:32,135 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:47:32,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9358647] [2021-11-19 13:47:32,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9358647] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:47:32,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367781970] [2021-11-19 13:47:32,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:47:32,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:47:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:47:32,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:47:32,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-19 13:47:32,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 13:47:32,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:47:32,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 37 conjunts are in the unsatisfiable core [2021-11-19 13:47:32,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:47:32,483 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-19 13:47:32,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,544 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-19 13:47:32,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,595 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-19 13:47:32,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,655 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-19 13:47:32,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,754 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 48 treesize of output 56 [2021-11-19 13:47:32,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,847 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 57 treesize of output 68 [2021-11-19 13:47:32,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:32,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:33,022 INFO L354 Elim1Store]: treesize reduction 384, result has 13.9 percent of original size [2021-11-19 13:47:33,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 100 [2021-11-19 13:47:37,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:37,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:37,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:37,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:37,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:37,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:47:37,201 INFO L354 Elim1Store]: treesize reduction 288, result has 11.4 percent of original size [2021-11-19 13:47:37,202 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 18 case distinctions, treesize of input 84 treesize of output 98 [2021-11-19 13:47:39,375 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-19 13:47:39,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:47:41,243 INFO L354 Elim1Store]: treesize reduction 898, result has 6.9 percent of original size [2021-11-19 13:47:41,243 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 196 treesize of output 81 [2021-11-19 13:47:41,258 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:47:41,258 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-19 13:47:41,265 INFO L354 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2021-11-19 13:47:41,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 50 [2021-11-19 13:47:41,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,275 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,420 INFO L354 Elim1Store]: treesize reduction 487, result has 10.5 percent of original size [2021-11-19 13:47:41,420 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 196 treesize of output 71 [2021-11-19 13:47:41,430 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:47:41,430 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-19 13:47:41,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,446 INFO L354 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2021-11-19 13:47:41,447 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-19 13:47:41,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,596 INFO L354 Elim1Store]: treesize reduction 497, result has 8.6 percent of original size [2021-11-19 13:47:41,596 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 194 treesize of output 59 [2021-11-19 13:47:41,605 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:47:41,605 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-19 13:47:41,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:47:41,619 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-19 13:47:41,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 24 [2021-11-19 13:47:41,999 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-19 13:47:42,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367781970] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:47:42,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [306868275] [2021-11-19 13:47:42,001 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-19 13:47:42,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:47:42,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 37 [2021-11-19 13:47:42,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904737578] [2021-11-19 13:47:42,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:47:42,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-19 13:47:42,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:47:42,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-19 13:47:42,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1169, Unknown=1, NotChecked=0, Total=1406 [2021-11-19 13:47:42,009 INFO L87 Difference]: Start difference. First operand 4765 states and 10096 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-19 13:48:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:48:08,261 INFO L93 Difference]: Finished difference Result 8222 states and 16968 transitions. [2021-11-19 13:48:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-19 13:48:08,261 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-19 13:48:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:48:08,277 INFO L225 Difference]: With dead ends: 8222 [2021-11-19 13:48:08,278 INFO L226 Difference]: Without dead ends: 8222 [2021-11-19 13:48:08,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=1021, Invalid=3800, Unknown=9, NotChecked=0, Total=4830 [2021-11-19 13:48:08,279 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 656 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-19 13:48:08,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 316 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 814 Invalid, 0 Unknown, 294 Unchecked, 0.7s Time] [2021-11-19 13:48:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8222 states. [2021-11-19 13:48:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8222 to 4789. [2021-11-19 13:48:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4789 states, 4782 states have (on average 2.121288163948139) internal successors, (10144), 4788 states have internal predecessors, (10144), 0 states have call successors, (0), 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-19 13:48:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 10144 transitions. [2021-11-19 13:48:08,473 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 10144 transitions. Word has length 45 [2021-11-19 13:48:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:48:08,473 INFO L470 AbstractCegarLoop]: Abstraction has 4789 states and 10144 transitions. [2021-11-19 13:48:08,474 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-19 13:48:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 10144 transitions. [2021-11-19 13:48:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:48:08,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:48:08,478 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-19 13:48:08,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-11-19 13:48:08,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-19 13:48:08,705 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:48:08,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:48:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2070567877, now seen corresponding path program 6 times [2021-11-19 13:48:08,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:48:08,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315246119] [2021-11-19 13:48:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:48:08,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:48:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:48:09,495 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-19 13:48:09,496 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:48:09,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315246119] [2021-11-19 13:48:09,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315246119] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:48:09,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369516676] [2021-11-19 13:48:09,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:48:09,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:48:09,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:48:09,498 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:48:09,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-19 13:48:09,730 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:48:09,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:48:09,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-19 13:48:09,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:48:10,058 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-19 13:48:10,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,101 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-19 13:48:10,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,186 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-19 13:48:10,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,268 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-19 13:48:10,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,406 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 48 treesize of output 56 [2021-11-19 13:48:10,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,548 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 57 treesize of output 68 [2021-11-19 13:48:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,717 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 66 treesize of output 80 [2021-11-19 13:48:10,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:10,946 INFO L354 Elim1Store]: treesize reduction 459, result has 13.4 percent of original size [2021-11-19 13:48:10,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 112 [2021-11-19 13:48:15,049 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-19 13:48:15,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:48:17,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:17,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:18,329 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-19 13:48:18,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369516676] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:48:18,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [612579137] [2021-11-19 13:48:18,330 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-19 13:48:18,331 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:48:18,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 37 [2021-11-19 13:48:18,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633573929] [2021-11-19 13:48:18,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:48:18,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-19 13:48:18,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:48:18,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-19 13:48:18,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1145, Unknown=1, NotChecked=0, Total=1406 [2021-11-19 13:48:18,333 INFO L87 Difference]: Start difference. First operand 4789 states and 10144 transitions. Second operand has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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-19 13:48:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:48:47,439 INFO L93 Difference]: Finished difference Result 9745 states and 20039 transitions. [2021-11-19 13:48:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-19 13:48:47,439 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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-19 13:48:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:48:47,468 INFO L225 Difference]: With dead ends: 9745 [2021-11-19 13:48:47,468 INFO L226 Difference]: Without dead ends: 9739 [2021-11-19 13:48:47,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=1561, Invalid=5238, Unknown=7, NotChecked=0, Total=6806 [2021-11-19 13:48:47,469 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 1171 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 620 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-19 13:48:47,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1171 Valid, 226 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 2110 Invalid, 0 Unknown, 620 Unchecked, 1.9s Time] [2021-11-19 13:48:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2021-11-19 13:48:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 4928. [2021-11-19 13:48:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 4921 states have (on average 2.11908148750254) internal successors, (10428), 4927 states have internal predecessors, (10428), 0 states have call successors, (0), 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-19 13:48:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 10428 transitions. [2021-11-19 13:48:47,647 INFO L78 Accepts]: Start accepts. Automaton has 4928 states and 10428 transitions. Word has length 45 [2021-11-19 13:48:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:48:47,647 INFO L470 AbstractCegarLoop]: Abstraction has 4928 states and 10428 transitions. [2021-11-19 13:48:47,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 38 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-19 13:48:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4928 states and 10428 transitions. [2021-11-19 13:48:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:48:47,650 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:48:47,651 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-19 13:48:47,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-19 13:48:47,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:48:47,878 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:48:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:48:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1279244051, now seen corresponding path program 7 times [2021-11-19 13:48:47,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:48:47,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416178869] [2021-11-19 13:48:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:48:47,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:48:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:48:48,354 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-19 13:48:48,354 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:48:48,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416178869] [2021-11-19 13:48:48,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416178869] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:48:48,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427181130] [2021-11-19 13:48:48,355 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 13:48:48,355 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:48:48,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:48:48,356 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:48:48,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-19 13:48:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:48:48,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 40 conjunts are in the unsatisfiable core [2021-11-19 13:48:48,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:48:48,697 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-19 13:48:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,732 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-19 13:48:48,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,775 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-19 13:48:48,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,828 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-19 13:48:48,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,892 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 48 treesize of output 56 [2021-11-19 13:48:48,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:48,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:49,000 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 57 treesize of output 68 [2021-11-19 13:48:49,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:49,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:49,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:49,240 INFO L354 Elim1Store]: treesize reduction 384, result has 13.9 percent of original size [2021-11-19 13:48:49,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 100 [2021-11-19 13:48:55,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:55,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:55,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:55,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:55,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:48:55,396 INFO L354 Elim1Store]: treesize reduction 288, result has 11.4 percent of original size [2021-11-19 13:48:55,396 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 18 case distinctions, treesize of input 84 treesize of output 98 [2021-11-19 13:48:57,486 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-19 13:48:57,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:48:59,537 INFO L354 Elim1Store]: treesize reduction 903, result has 6.9 percent of original size [2021-11-19 13:48:59,537 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 583 treesize of output 81 [2021-11-19 13:48:59,543 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:48:59,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2021-11-19 13:48:59,549 INFO L354 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2021-11-19 13:48:59,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 50 [2021-11-19 13:48:59,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,559 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,687 INFO L354 Elim1Store]: treesize reduction 504, result has 10.5 percent of original size [2021-11-19 13:48:59,687 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 583 treesize of output 73 [2021-11-19 13:48:59,695 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:48:59,695 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-19 13:48:59,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,725 INFO L354 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2021-11-19 13:48:59,725 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-19 13:48:59,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,845 INFO L354 Elim1Store]: treesize reduction 516, result has 8.3 percent of original size [2021-11-19 13:48:59,845 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 581 treesize of output 59 [2021-11-19 13:48:59,852 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:48:59,852 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-19 13:48:59,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:48:59,862 INFO L354 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2021-11-19 13:48:59,862 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 38 treesize of output 24 [2021-11-19 13:49:00,185 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-19 13:49:00,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427181130] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:49:00,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [5867009] [2021-11-19 13:49:00,186 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-19 13:49:00,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:49:00,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 37 [2021-11-19 13:49:00,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502743281] [2021-11-19 13:49:00,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:49:00,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-11-19 13:49:00,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:49:00,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-11-19 13:49:00,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1188, Unknown=2, NotChecked=0, Total=1406 [2021-11-19 13:49:00,191 INFO L87 Difference]: Start difference. First operand 4928 states and 10428 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-19 13:49:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:49:46,906 INFO L93 Difference]: Finished difference Result 7924 states and 16232 transitions. [2021-11-19 13:49:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-11-19 13:49:46,907 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-19 13:49:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:49:46,917 INFO L225 Difference]: With dead ends: 7924 [2021-11-19 13:49:46,917 INFO L226 Difference]: Without dead ends: 7919 [2021-11-19 13:49:46,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 90 SyntacticMatches, 27 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=1638, Invalid=5315, Unknown=19, NotChecked=0, Total=6972 [2021-11-19 13:49:46,918 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 927 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 4152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1552 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-19 13:49:46,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 337 Invalid, 4152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2411 Invalid, 0 Unknown, 1552 Unchecked, 2.0s Time] [2021-11-19 13:49:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7919 states. [2021-11-19 13:49:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7919 to 5047. [2021-11-19 13:49:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5047 states, 5040 states have (on average 2.1162698412698413) internal successors, (10666), 5046 states have internal predecessors, (10666), 0 states have call successors, (0), 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-19 13:49:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 10666 transitions. [2021-11-19 13:49:47,097 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 10666 transitions. Word has length 45 [2021-11-19 13:49:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:49:47,097 INFO L470 AbstractCegarLoop]: Abstraction has 5047 states and 10666 transitions. [2021-11-19 13:49:47,098 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-19 13:49:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 10666 transitions. [2021-11-19 13:49:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:49:47,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:49:47,101 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-19 13:49:47,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-11-19 13:49:47,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:49:47,330 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:49:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:49:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -985432526, now seen corresponding path program 1 times [2021-11-19 13:49:47,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:49:47,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050881796] [2021-11-19 13:49:47,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:49:47,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:49:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:49:47,537 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-19 13:49:47,537 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:49:47,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050881796] [2021-11-19 13:49:47,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050881796] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:49:47,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450531409] [2021-11-19 13:49:47,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:49:47,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:49:47,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:49:47,538 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:49:47,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-19 13:49:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:49:47,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-19 13:49:47,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:49:47,835 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-19 13:49:47,938 INFO L354 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2021-11-19 13:49:47,938 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-19 13:49:48,010 INFO L354 Elim1Store]: treesize reduction 76, result has 22.4 percent of original size [2021-11-19 13:49:48,011 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 44 treesize of output 46 [2021-11-19 13:49:48,129 INFO L354 Elim1Store]: treesize reduction 129, result has 19.4 percent of original size [2021-11-19 13:49:48,130 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 53 treesize of output 58 [2021-11-19 13:49:48,240 INFO L354 Elim1Store]: treesize reduction 194, result has 17.1 percent of original size [2021-11-19 13:49:48,240 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-19 13:49:48,312 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-19 13:49:48,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:49:48,403 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-11-19 13:49:48,403 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-19 13:49:48,408 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:49:48,408 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 29 treesize of output 29 [2021-11-19 13:49:48,413 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:49:48,414 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 32 treesize of output 32 [2021-11-19 13:49:48,648 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-19 13:49:48,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450531409] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:49:48,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [622180526] [2021-11-19 13:49:48,649 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-19 13:49:48,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:49:48,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2021-11-19 13:49:48,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354963425] [2021-11-19 13:49:48,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:49:48,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-19 13:49:48,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:49:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-19 13:49:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-11-19 13:49:48,651 INFO L87 Difference]: Start difference. First operand 5047 states and 10666 transitions. Second operand has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 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-19 13:49:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:49:54,412 INFO L93 Difference]: Finished difference Result 9914 states and 20366 transitions. [2021-11-19 13:49:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2021-11-19 13:49:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 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-19 13:49:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:49:54,430 INFO L225 Difference]: With dead ends: 9914 [2021-11-19 13:49:54,430 INFO L226 Difference]: Without dead ends: 9906 [2021-11-19 13:49:54,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5930 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3491, Invalid=11271, Unknown=0, NotChecked=0, Total=14762 [2021-11-19 13:49:54,433 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 880 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 3628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-19 13:49:54,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [880 Valid, 306 Invalid, 3628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2603 Invalid, 0 Unknown, 654 Unchecked, 2.4s Time] [2021-11-19 13:49:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9906 states. [2021-11-19 13:49:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9906 to 6297. [2021-11-19 13:49:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6297 states, 6290 states have (on average 2.121939586645469) internal successors, (13347), 6296 states have internal predecessors, (13347), 0 states have call successors, (0), 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-19 13:49:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6297 states to 6297 states and 13347 transitions. [2021-11-19 13:49:54,629 INFO L78 Accepts]: Start accepts. Automaton has 6297 states and 13347 transitions. Word has length 45 [2021-11-19 13:49:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:49:54,630 INFO L470 AbstractCegarLoop]: Abstraction has 6297 states and 13347 transitions. [2021-11-19 13:49:54,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 27 states have internal predecessors, (93), 0 states have call successors, (0), 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-19 13:49:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6297 states and 13347 transitions. [2021-11-19 13:49:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:49:54,635 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:49:54,635 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-19 13:49:54,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-19 13:49:54,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:49:54,862 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:49:54,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:49:54,863 INFO L85 PathProgramCache]: Analyzing trace with hash -924658886, now seen corresponding path program 2 times [2021-11-19 13:49:54,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:49:54,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855653101] [2021-11-19 13:49:54,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:49:54,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:49:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:49:55,171 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-19 13:49:55,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:49:55,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855653101] [2021-11-19 13:49:55,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855653101] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:49:55,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533113491] [2021-11-19 13:49:55,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:49:55,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:49:55,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:49:55,178 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:49:55,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-19 13:49:55,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 13:49:55,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:49:55,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-19 13:49:55,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:49:55,323 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 5 treesize of output 3 [2021-11-19 13:49:55,786 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-19 13:49:55,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,831 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-19 13:49:55,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,900 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:49:55,901 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 28 treesize of output 30 [2021-11-19 13:49:55,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:55,962 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:49:55,963 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 37 treesize of output 42 [2021-11-19 13:49:56,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:49:56,037 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:49:56,037 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 6 case distinctions, treesize of input 46 treesize of output 54 [2021-11-19 13:49:56,095 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-19 13:49:56,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:49:56,284 INFO L354 Elim1Store]: treesize reduction 85, result has 24.1 percent of original size [2021-11-19 13:49:56,284 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 41 [2021-11-19 13:49:56,291 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:49:56,292 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 41 treesize of output 37 [2021-11-19 13:49:56,303 INFO L354 Elim1Store]: treesize reduction 25, result has 13.8 percent of original size [2021-11-19 13:49:56,304 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 42 treesize of output 38 [2021-11-19 13:49:56,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:49:56,347 INFO L354 Elim1Store]: treesize reduction 56, result has 32.5 percent of original size [2021-11-19 13:49:56,347 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-19 13:49:56,351 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 41 treesize of output 33 [2021-11-19 13:49:56,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:49:56,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:49:56,355 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 24 treesize of output 16 [2021-11-19 13:49:56,701 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-19 13:49:56,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533113491] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:49:56,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [908809041] [2021-11-19 13:49:56,702 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-19 13:49:56,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:49:56,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-11-19 13:49:56,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571111751] [2021-11-19 13:49:56,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:49:56,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-19 13:49:56,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:49:56,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-19 13:49:56,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2021-11-19 13:49:56,704 INFO L87 Difference]: Start difference. First operand 6297 states and 13347 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-19 13:50:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:50:01,053 INFO L93 Difference]: Finished difference Result 9019 states and 18501 transitions. [2021-11-19 13:50:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-19 13:50:01,053 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-19 13:50:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:50:01,068 INFO L225 Difference]: With dead ends: 9019 [2021-11-19 13:50:01,068 INFO L226 Difference]: Without dead ends: 9016 [2021-11-19 13:50:01,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1255, Invalid=4001, Unknown=0, NotChecked=0, Total=5256 [2021-11-19 13:50:01,070 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 960 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-19 13:50:01,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [960 Valid, 271 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-19 13:50:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9016 states. [2021-11-19 13:50:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9016 to 5827. [2021-11-19 13:50:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5827 states, 5820 states have (on average 2.1060137457044674) internal successors, (12257), 5826 states have internal predecessors, (12257), 0 states have call successors, (0), 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-19 13:50:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 12257 transitions. [2021-11-19 13:50:01,284 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 12257 transitions. Word has length 45 [2021-11-19 13:50:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:50:01,284 INFO L470 AbstractCegarLoop]: Abstraction has 5827 states and 12257 transitions. [2021-11-19 13:50:01,284 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-19 13:50:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 12257 transitions. [2021-11-19 13:50:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:50:01,290 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:50:01,291 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-19 13:50:01,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-19 13:50:01,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-19 13:50:01,506 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:50:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:50:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1607877877, now seen corresponding path program 8 times [2021-11-19 13:50:01,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:50:01,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468858191] [2021-11-19 13:50:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:50:01,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:50:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:50:02,072 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-19 13:50:02,073 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:50:02,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468858191] [2021-11-19 13:50:02,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468858191] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:50:02,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498688987] [2021-11-19 13:50:02,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:50:02,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:50:02,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:50:02,075 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:50:02,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-19 13:50:02,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 13:50:02,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:50:02,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-19 13:50:02,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:50:02,604 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-19 13:50:02,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,657 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-19 13:50:02,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,724 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-19 13:50:02,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,804 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-19 13:50:02,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:02,893 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 48 treesize of output 56 [2021-11-19 13:50:03,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:03,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:03,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:03,105 INFO L354 Elim1Store]: treesize reduction 266, result has 15.8 percent of original size [2021-11-19 13:50:03,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 85 [2021-11-19 13:50:09,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:09,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:09,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:09,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:09,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:09,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:09,266 INFO L354 Elim1Store]: treesize reduction 174, result has 12.6 percent of original size [2021-11-19 13:50:09,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 72 treesize of output 83 [2021-11-19 13:50:11,361 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-19 13:50:11,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:50:12,465 INFO L354 Elim1Store]: treesize reduction 597, result has 8.7 percent of original size [2021-11-19 13:50:12,465 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 6 case distinctions, treesize of input 161 treesize of output 71 [2021-11-19 13:50:12,471 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:50:12,471 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-19 13:50:12,476 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-11-19 13:50:12,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 46 [2021-11-19 13:50:12,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,572 INFO L354 Elim1Store]: treesize reduction 354, result has 11.7 percent of original size [2021-11-19 13:50:12,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 59 [2021-11-19 13:50:12,579 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:50:12,579 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-19 13:50:12,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,589 INFO L354 Elim1Store]: treesize reduction 34, result has 2.9 percent of original size [2021-11-19 13:50:12,589 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 38 treesize of output 24 [2021-11-19 13:50:12,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,684 INFO L354 Elim1Store]: treesize reduction 344, result has 14.2 percent of original size [2021-11-19 13:50:12,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 71 [2021-11-19 13:50:12,693 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:50:12,693 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-19 13:50:12,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:50:12,706 INFO L354 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2021-11-19 13:50:12,707 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-19 13:50:13,011 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-19 13:50:13,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498688987] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:50:13,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1130865399] [2021-11-19 13:50:13,012 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-19 13:50:13,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:50:13,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 35 [2021-11-19 13:50:13,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898839447] [2021-11-19 13:50:13,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:50:13,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-19 13:50:13,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:50:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-19 13:50:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1067, Unknown=2, NotChecked=0, Total=1260 [2021-11-19 13:50:13,015 INFO L87 Difference]: Start difference. First operand 5827 states and 12257 transitions. Second operand has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 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-19 13:50:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:50:51,103 INFO L93 Difference]: Finished difference Result 10837 states and 22160 transitions. [2021-11-19 13:50:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-19 13:50:51,103 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 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-19 13:50:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:50:51,114 INFO L225 Difference]: With dead ends: 10837 [2021-11-19 13:50:51,115 INFO L226 Difference]: Without dead ends: 10829 [2021-11-19 13:50:51,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 14 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2372 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=1404, Invalid=5389, Unknown=13, NotChecked=0, Total=6806 [2021-11-19 13:50:51,115 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1062 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 4431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1974 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-19 13:50:51,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 279 Invalid, 4431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2218 Invalid, 0 Unknown, 1974 Unchecked, 1.8s Time] [2021-11-19 13:50:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10829 states. [2021-11-19 13:50:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10829 to 6156. [2021-11-19 13:50:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6156 states, 6149 states have (on average 2.1024556838510327) internal successors, (12928), 6155 states have internal predecessors, (12928), 0 states have call successors, (0), 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-19 13:50:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6156 states to 6156 states and 12928 transitions. [2021-11-19 13:50:51,293 INFO L78 Accepts]: Start accepts. Automaton has 6156 states and 12928 transitions. Word has length 45 [2021-11-19 13:50:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:50:51,294 INFO L470 AbstractCegarLoop]: Abstraction has 6156 states and 12928 transitions. [2021-11-19 13:50:51,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 36 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-19 13:50:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6156 states and 12928 transitions. [2021-11-19 13:50:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:50:51,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:50:51,298 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-19 13:50:51,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-19 13:50:51,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-19 13:50:51,514 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:50:51,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:50:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash 954504089, now seen corresponding path program 9 times [2021-11-19 13:50:51,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:50:51,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536979269] [2021-11-19 13:50:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:50:51,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:50:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:50:52,228 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-19 13:50:52,228 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:50:52,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536979269] [2021-11-19 13:50:52,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536979269] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:50:52,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133422438] [2021-11-19 13:50:52,228 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:50:52,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:50:52,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:50:52,229 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:50:52,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-19 13:50:52,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:50:52,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:50:52,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-19 13:50:52,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:50:52,672 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-19 13:50:52,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,721 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-19 13:50:52,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,794 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-19 13:50:52,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,862 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-19 13:50:52,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:52,953 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-19 13:50:53,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,065 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-19 13:50:53,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,183 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-19 13:50:53,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,315 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-19 13:50:53,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:50:53,614 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-19 13:50:53,614 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 35 case distinctions, treesize of input 106 treesize of output 115 [2021-11-19 13:51:03,727 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-19 13:51:03,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:51:06,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,601 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:06,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:07,011 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-19 13:51:07,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133422438] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:51:07,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [134513999] [2021-11-19 13:51:07,012 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-19 13:51:07,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:51:07,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-19 13:51:07,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532566241] [2021-11-19 13:51:07,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:51:07,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 13:51:07,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:51:07,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 13:51:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1201, Unknown=4, NotChecked=0, Total=1482 [2021-11-19 13:51:07,015 INFO L87 Difference]: Start difference. First operand 6156 states and 12928 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-19 13:51:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:51:29,188 INFO L93 Difference]: Finished difference Result 7670 states and 15745 transitions. [2021-11-19 13:51:29,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-19 13:51:29,188 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-19 13:51:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:51:29,196 INFO L225 Difference]: With dead ends: 7670 [2021-11-19 13:51:29,197 INFO L226 Difference]: Without dead ends: 7670 [2021-11-19 13:51:29,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=1119, Invalid=3699, Unknown=12, NotChecked=0, Total=4830 [2021-11-19 13:51:29,197 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 393 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-19 13:51:29,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 435 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 876 Invalid, 0 Unknown, 85 Unchecked, 0.6s Time] [2021-11-19 13:51:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2021-11-19 13:51:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 6162. [2021-11-19 13:51:29,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6162 states, 6155 states have (on average 2.1023558082859464) internal successors, (12940), 6161 states have internal predecessors, (12940), 0 states have call successors, (0), 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-19 13:51:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6162 states to 6162 states and 12940 transitions. [2021-11-19 13:51:29,299 INFO L78 Accepts]: Start accepts. Automaton has 6162 states and 12940 transitions. Word has length 45 [2021-11-19 13:51:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:51:29,299 INFO L470 AbstractCegarLoop]: Abstraction has 6162 states and 12940 transitions. [2021-11-19 13:51:29,299 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-19 13:51:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 12940 transitions. [2021-11-19 13:51:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:51:29,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:51:29,302 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-19 13:51:29,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-19 13:51:29,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-19 13:51:29,530 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:51:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:51:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash -499990139, now seen corresponding path program 10 times [2021-11-19 13:51:29,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:51:29,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697687809] [2021-11-19 13:51:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:51:29,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:51:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:51:30,149 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-19 13:51:30,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:51:30,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697687809] [2021-11-19 13:51:30,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697687809] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:51:30,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575126996] [2021-11-19 13:51:30,150 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 13:51:30,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:51:30,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:51:30,151 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:51:30,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-19 13:51:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:51:30,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-19 13:51:30,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:51:30,513 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-19 13:51:30,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,559 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-19 13:51:30,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,605 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-19 13:51:30,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,663 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-19 13:51:30,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,730 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-19 13:51:30,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2021-11-19 13:51:30,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:30,898 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-19 13:51:31,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:31,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:31,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:31,113 INFO L354 Elim1Store]: treesize reduction 475, result has 11.5 percent of original size [2021-11-19 13:51:31,113 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 27 case distinctions, treesize of input 97 treesize of output 103 [2021-11-19 13:51:41,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:41,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:41,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:41,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:41,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:41,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:51:41,267 INFO L354 Elim1Store]: treesize reduction 288, result has 11.4 percent of original size [2021-11-19 13:51:41,267 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 18 case distinctions, treesize of input 84 treesize of output 98 [2021-11-19 13:51:43,368 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-19 13:51:43,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:51:45,377 INFO L354 Elim1Store]: treesize reduction 958, result has 6.5 percent of original size [2021-11-19 13:51:45,378 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 73 treesize of output 81 [2021-11-19 13:51:45,384 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:51:45,384 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-19 13:51:45,393 INFO L354 Elim1Store]: treesize reduction 170, result has 0.6 percent of original size [2021-11-19 13:51:45,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 50 [2021-11-19 13:51:45,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,401 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,517 INFO L354 Elim1Store]: treesize reduction 599, result has 7.3 percent of original size [2021-11-19 13:51:45,518 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 71 treesize of output 59 [2021-11-19 13:51:45,540 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:51:45,541 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-19 13:51:45,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,554 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-11-19 13:51:45,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 24 [2021-11-19 13:51:45,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,712 INFO L354 Elim1Store]: treesize reduction 589, result has 8.8 percent of original size [2021-11-19 13:51:45,713 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 73 treesize of output 71 [2021-11-19 13:51:45,723 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-19 13:51:45,724 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-19 13:51:45,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:51:45,741 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-11-19 13:51:45,741 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-19 13:51:46,141 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-19 13:51:46,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575126996] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:51:46,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2010233217] [2021-11-19 13:51:46,142 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-19 13:51:46,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:51:46,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2021-11-19 13:51:46,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144334798] [2021-11-19 13:51:46,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:51:46,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 13:51:46,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:51:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 13:51:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1236, Unknown=4, NotChecked=0, Total=1482 [2021-11-19 13:51:46,143 INFO L87 Difference]: Start difference. First operand 6162 states and 12940 transitions. Second operand has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 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-19 13:52:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:52:55,119 INFO L93 Difference]: Finished difference Result 9527 states and 19629 transitions. [2021-11-19 13:52:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-19 13:52:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 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-19 13:52:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:52:55,139 INFO L225 Difference]: With dead ends: 9527 [2021-11-19 13:52:55,139 INFO L226 Difference]: Without dead ends: 9521 [2021-11-19 13:52:55,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 74 SyntacticMatches, 26 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2747 ImplicationChecksByTransitivity, 81.3s TimeCoverageRelationStatistics Valid=1492, Invalid=5128, Unknown=22, NotChecked=0, Total=6642 [2021-11-19 13:52:55,141 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 878 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 3912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1088 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:52:55,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [878 Valid, 287 Invalid, 3912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2567 Invalid, 0 Unknown, 1088 Unchecked, 2.1s Time] [2021-11-19 13:52:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9521 states. [2021-11-19 13:52:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9521 to 6145. [2021-11-19 13:52:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6145 states, 6138 states have (on average 2.10019550342131) internal successors, (12891), 6144 states have internal predecessors, (12891), 0 states have call successors, (0), 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-19 13:52:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 12891 transitions. [2021-11-19 13:52:55,280 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 12891 transitions. Word has length 45 [2021-11-19 13:52:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:52:55,280 INFO L470 AbstractCegarLoop]: Abstraction has 6145 states and 12891 transitions. [2021-11-19 13:52:55,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6842105263157894) internal successors, (102), 39 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-19 13:52:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 12891 transitions. [2021-11-19 13:52:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:52:55,283 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:52:55,284 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-19 13:52:55,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-19 13:52:55,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:52:55,498 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:52:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:52:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2035398471, now seen corresponding path program 11 times [2021-11-19 13:52:55,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:52:55,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648693096] [2021-11-19 13:52:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:52:55,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:52:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:52:56,292 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-19 13:52:56,292 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:52:56,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648693096] [2021-11-19 13:52:56,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648693096] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:52:56,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353386111] [2021-11-19 13:52:56,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:52:56,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:52:56,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:52:56,293 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:52:56,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-19 13:52:56,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 13:52:56,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:52:56,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-19 13:52:56,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:52:56,632 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-19 13:52:56,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,686 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-19 13:52:56,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,737 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:52:56,737 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 28 treesize of output 30 [2021-11-19 13:52:56,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,797 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:52:56,797 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 37 treesize of output 42 [2021-11-19 13:52:56,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,865 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:52:56,865 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 6 case distinctions, treesize of input 46 treesize of output 54 [2021-11-19 13:52:56,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:56,949 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:52:56,949 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 10 case distinctions, treesize of input 55 treesize of output 66 [2021-11-19 13:52:57,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,052 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:52:57,052 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 15 case distinctions, treesize of input 64 treesize of output 78 [2021-11-19 13:52:57,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,161 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-19 13:52:57,162 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 21 case distinctions, treesize of input 73 treesize of output 90 [2021-11-19 13:52:57,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:52:57,421 INFO L354 Elim1Store]: treesize reduction 660, result has 9.7 percent of original size [2021-11-19 13:52:57,422 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 35 case distinctions, treesize of input 106 treesize of output 115 [2021-11-19 13:53:05,571 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-19 13:53:05,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:53:10,774 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |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_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |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))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0))) is different from false [2021-11-19 13:53:10,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:10,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:53:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2021-11-19 13:53:11,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353386111] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:53:11,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [729023934] [2021-11-19 13:53:11,428 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-19 13:53:11,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:53:11,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 16] total 40 [2021-11-19 13:53:11,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694701827] [2021-11-19 13:53:11,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:53:11,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-19 13:53:11,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:53:11,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-19 13:53:11,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1325, Unknown=4, NotChecked=76, Total=1640 [2021-11-19 13:53:11,432 INFO L87 Difference]: Start difference. First operand 6145 states and 12891 transitions. Second operand has 41 states, 40 states have (on average 2.575) internal successors, (103), 41 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-19 13:53:14,427 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| 3))) (<= (+ |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|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.offset| 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (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_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_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)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |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))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2021-11-19 13:53:16,524 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|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |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_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |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))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2021-11-19 13:53:18,642 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| 3))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.offset| 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (= (select (select |c_#race| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_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)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |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))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2021-11-19 13:53:56,333 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) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.offset| 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse9 |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))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_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|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse10 (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse14 |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))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12)) 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse19 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19)) 0)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2021-11-19 13:53:58,396 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)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= |c_~#cache~0.offset| 0) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse9 |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))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |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_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse10 (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse14 |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))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12)) 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse19 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19)) 0)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2021-11-19 13:54:00,469 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| 3))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (= |c_~#cache~0.offset| 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (<= 0 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_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|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |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))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2021-11-19 13:54:06,367 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) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (<= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 28) (+ |c_~#cache~0.offset| .cse0)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse9 |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))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_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|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse10 (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse14 |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))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12)) 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse19 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19)) 0)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2021-11-19 13:54:08,427 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)) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse5 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse5 0))))) (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse5)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse6 (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse9 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse9 |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))))) (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse7 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse6 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |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_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse12 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse10 (let ((.cse11 (let ((.cse13 (let ((.cse14 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse14 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse14 |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))))) (store .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse13 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse11 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12 0))))) (store .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse10 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse12)) 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| |c_~#cache~0.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse19 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse15 (let ((.cse16 (let ((.cse17 (let ((.cse18 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse18 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse16 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse15 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse19)) 0)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2021-11-19 13:54:10,490 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| 3))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (= (select (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (not (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse4 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2))) (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (let ((.cse3 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1) 0) .cse4 0))))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse4)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (select (select (let ((.cse5 (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse8 |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))))) (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse5 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_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|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse11 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3))) (select (select (let ((.cse9 (let ((.cse10 (let ((.cse12 (let ((.cse13 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse13 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse13 |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))))) (store .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse12 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse10 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11 0))))) (store .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse9 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse11)) 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| Int)) (= (let ((.cse18 (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 1))) (select (select (let ((.cse14 (let ((.cse15 (let ((.cse16 (let ((.cse17 (store |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)))) (store .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (store (select .cse17 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18 0) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 2) 0))))) (store .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse16 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) 0))))) (store .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse15 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) 0))))) (store .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select .cse14 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) 0) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1_168|))) |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) .cse18)) 0)) (not (= (+ |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 3) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2021-11-19 13:54:12,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:54:12,271 INFO L93 Difference]: Finished difference Result 19041 states and 39135 transitions. [2021-11-19 13:54:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-11-19 13:54:12,271 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.575) internal successors, (103), 41 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-19 13:54:12,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:54:12,323 INFO L225 Difference]: With dead ends: 19041 [2021-11-19 13:54:12,323 INFO L226 Difference]: Without dead ends: 19040 [2021-11-19 13:54:12,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 67 SyntacticMatches, 44 SemanticMatches, 139 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 9113 ImplicationChecksByTransitivity, 71.3s TimeCoverageRelationStatistics Valid=2695, Invalid=14353, Unknown=22, NotChecked=2670, Total=19740 [2021-11-19 13:54:12,325 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 1057 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 6387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2576 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:54:12,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 447 Invalid, 6387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3673 Invalid, 0 Unknown, 2576 Unchecked, 3.1s Time] [2021-11-19 13:54:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19040 states. [2021-11-19 13:54:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19040 to 7935. [2021-11-19 13:54:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7935 states, 7928 states have (on average 2.1121342078708376) internal successors, (16745), 7934 states have internal predecessors, (16745), 0 states have call successors, (0), 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-19 13:54:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 16745 transitions. [2021-11-19 13:54:12,571 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 16745 transitions. Word has length 45 [2021-11-19 13:54:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:54:12,572 INFO L470 AbstractCegarLoop]: Abstraction has 7935 states and 16745 transitions. [2021-11-19 13:54:12,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.575) internal successors, (103), 41 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-19 13:54:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 16745 transitions. [2021-11-19 13:54:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:54:12,574 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:54:12,574 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-19 13:54:12,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-19 13:54:12,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-19 13:54:12,775 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:54:12,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:54:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash 663243701, now seen corresponding path program 12 times [2021-11-19 13:54:12,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:54:12,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192003051] [2021-11-19 13:54:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:54:12,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:54:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:54:13,559 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-19 13:54:13,559 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:54:13,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192003051] [2021-11-19 13:54:13,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192003051] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:54:13,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181976747] [2021-11-19 13:54:13,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-19 13:54:13,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:54:13,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:54:13,560 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:54:13,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-19 13:54:13,778 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-19 13:54:13,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:54:13,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-19 13:54:13,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:54:14,045 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-19 13:54:14,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,098 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-19 13:54:14,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,153 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-19 13:54:14,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,219 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-19 13:54:14,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,294 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-19 13:54:14,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,389 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-19 13:54:14,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,494 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-19 13:54:14,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,607 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-19 13:54:14,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:14,892 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-19 13:54:14,892 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 35 case distinctions, treesize of input 106 treesize of output 115 [2021-11-19 13:54:19,009 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-19 13:54:19,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:54:24,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-19 13:54:24,910 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-19 13:54:24,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181976747] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:54:24,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854222417] [2021-11-19 13:54:24,911 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-19 13:54:24,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:54:24,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 14] total 38 [2021-11-19 13:54:24,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392296508] [2021-11-19 13:54:24,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:54:24,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-19 13:54:24,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:54:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-19 13:54:24,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1209, Unknown=1, NotChecked=0, Total=1482 [2021-11-19 13:54:24,914 INFO L87 Difference]: Start difference. First operand 7935 states and 16745 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-19 13:54:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:54:56,060 INFO L93 Difference]: Finished difference Result 11866 states and 24561 transitions. [2021-11-19 13:54:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-19 13:54:56,061 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-19 13:54:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:54:56,077 INFO L225 Difference]: With dead ends: 11866 [2021-11-19 13:54:56,077 INFO L226 Difference]: Without dead ends: 11862 [2021-11-19 13:54:56,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=1514, Invalid=4954, Unknown=12, NotChecked=0, Total=6480 [2021-11-19 13:54:56,078 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 897 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 4197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1715 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-19 13:54:56,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [897 Valid, 276 Invalid, 4197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2236 Invalid, 0 Unknown, 1715 Unchecked, 2.1s Time] [2021-11-19 13:54:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2021-11-19 13:54:56,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 3631. [2021-11-19 13:54:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3631 states, 3624 states have (on average 2.082505518763797) internal successors, (7547), 3630 states have internal predecessors, (7547), 0 states have call successors, (0), 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-19 13:54:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3631 states to 3631 states and 7547 transitions. [2021-11-19 13:54:56,195 INFO L78 Accepts]: Start accepts. Automaton has 3631 states and 7547 transitions. Word has length 45 [2021-11-19 13:54:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:54:56,196 INFO L470 AbstractCegarLoop]: Abstraction has 3631 states and 7547 transitions. [2021-11-19 13:54:56,196 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-19 13:54:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3631 states and 7547 transitions. [2021-11-19 13:54:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:54:56,198 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:54:56,198 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-19 13:54:56,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-19 13:54:56,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-19 13:54:56,401 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:54:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:54:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash -257161773, now seen corresponding path program 13 times [2021-11-19 13:54:56,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:54:56,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806233944] [2021-11-19 13:54:56,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:54:56,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:54:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:54:57,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-19 13:54:57,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:54:57,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806233944] [2021-11-19 13:54:57,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806233944] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:54:57,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943609589] [2021-11-19 13:54:57,243 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-19 13:54:57,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:54:57,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:54:57,244 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:54:57,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-19 13:54:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:54:57,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-19 13:54:57,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:54:57,544 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-19 13:54:57,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,629 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-19 13:54:57,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,692 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-19 13:54:57,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,782 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-19 13:54:57,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,879 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-19 13:54:57,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:57,968 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-19 13:54:58,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,062 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-19 13:54:58,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,171 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-19 13:54:58,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:54:58,477 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-19 13:54:58,477 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 35 case distinctions, treesize of input 106 treesize of output 115 [2021-11-19 13:55:08,598 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-19 13:55:08,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-19 13:55:23,140 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-19 13:55:23,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943609589] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-19 13:55:23,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651957852] [2021-11-19 13:55:23,140 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-19 13:55:23,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-19 13:55:23,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 39 [2021-11-19 13:55:23,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361425367] [2021-11-19 13:55:23,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-19 13:55:23,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-11-19 13:55:23,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-19 13:55:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-11-19 13:55:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1301, Unknown=6, NotChecked=0, Total=1560 [2021-11-19 13:55:23,144 INFO L87 Difference]: Start difference. First operand 3631 states and 7547 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-19 13:55:35,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-19 13:55:35,910 INFO L93 Difference]: Finished difference Result 6466 states and 13006 transitions. [2021-11-19 13:55:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-19 13:55:35,910 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-19 13:55:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-19 13:55:35,942 INFO L225 Difference]: With dead ends: 6466 [2021-11-19 13:55:35,942 INFO L226 Difference]: Without dead ends: 6460 [2021-11-19 13:55:35,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=929, Invalid=3092, Unknown=11, NotChecked=0, Total=4032 [2021-11-19 13:55:35,943 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 561 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 456 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-19 13:55:35,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 339 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1613 Invalid, 0 Unknown, 456 Unchecked, 1.3s Time] [2021-11-19 13:55:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2021-11-19 13:55:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 3701. [2021-11-19 13:55:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 3694 states have (on average 2.081754195993503) internal successors, (7690), 3700 states have internal predecessors, (7690), 0 states have call successors, (0), 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-19 13:55:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 7690 transitions. [2021-11-19 13:55:36,007 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 7690 transitions. Word has length 45 [2021-11-19 13:55:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-19 13:55:36,007 INFO L470 AbstractCegarLoop]: Abstraction has 3701 states and 7690 transitions. [2021-11-19 13:55:36,007 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-19 13:55:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 7690 transitions. [2021-11-19 13:55:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-19 13:55:36,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-19 13:55:36,009 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-19 13:55:36,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-19 13:55:36,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-19 13:55:36,210 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-11-19 13:55:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-19 13:55:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash -774011143, now seen corresponding path program 14 times [2021-11-19 13:55:36,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-19 13:55:36,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221374976] [2021-11-19 13:55:36,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-19 13:55:36,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-19 13:55:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-19 13:55:36,869 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-19 13:55:36,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-19 13:55:36,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221374976] [2021-11-19 13:55:36,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221374976] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-19 13:55:36,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100408002] [2021-11-19 13:55:36,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-19 13:55:36,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-19 13:55:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 [2021-11-19 13:55:36,870 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-19 13:55:36,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d13e801-3324-4f1c-93a4-810b7b3b40de/bin/utaipan-UbGMyvGFUs/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-19 13:55:36,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-19 13:55:36,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-19 13:55:36,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 38 conjunts are in the unsatisfiable core [2021-11-19 13:55:36,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-19 13:55:37,183 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-19 13:55:37,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-19 13:55:37,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,327 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-19 13:55:37,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,381 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-19 13:55:37,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,453 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-19 13:55:37,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,539 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-19 13:55:37,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,630 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-19 13:55:37,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,739 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-19 13:55:37,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:37,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-19 13:55:38,022 INFO L354 Elim1Store]: treesize reduction 564, result has 11.2 percent of original size [2021-11-19 13:55:38,022 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 35 case distinctions, treesize of input 106 treesize of output 115 [2021-11-19 13:55:48,135 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-19 13:55:48,135 INFO L328 TraceCheckSpWp]: Computing backward predicates...