./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/indexer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/indexer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba --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 f24afaadf07ead7c7da85cf6020fd6a6a5b5585e439441b5111a2dea2e7cec4c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 02:43:30,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:43:30,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:43:30,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:43:30,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:43:30,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:43:30,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:43:30,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:43:30,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:43:30,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:43:30,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:43:30,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:43:30,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:43:30,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:43:30,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:43:30,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:43:30,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:43:30,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:43:30,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:43:30,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:43:30,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:43:30,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:43:30,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:43:30,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:43:30,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:43:30,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:43:30,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:43:30,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:43:30,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:43:30,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:43:30,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:43:30,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:43:30,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:43:30,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:43:30,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:43:30,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:43:30,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:43:30,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:43:30,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:43:30,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:43:30,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:43:30,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-22 02:43:30,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:43:30,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:43:30,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:43:30,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:43:30,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:43:30,396 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:43:30,396 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:43:30,397 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:43:30,397 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:43:30,397 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:43:30,398 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:43:30,399 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:43:30,399 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:43:30,399 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:43:30,399 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:43:30,400 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:43:30,400 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:43:30,400 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:43:30,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:43:30,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:43:30,401 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:43:30,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:43:30,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:43:30,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:43:30,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:43:30,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:43:30,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:43:30,403 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-22 02:43:30,403 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:43:30,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:43:30,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:43:30,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:43:30,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:43:30,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:43:30,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:43:30,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:43:30,407 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:43:30,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:43:30,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:43:30,409 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:43:30,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:43:30,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:43:30,409 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:43:30,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/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_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba 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 -> f24afaadf07ead7c7da85cf6020fd6a6a5b5585e439441b5111a2dea2e7cec4c [2022-11-22 02:43:30,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:43:30,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:43:30,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:43:30,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:43:30,815 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:43:30,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread/indexer.i [2022-11-22 02:43:33,860 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:43:34,183 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:43:34,183 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/sv-benchmarks/c/pthread/indexer.i [2022-11-22 02:43:34,207 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/data/1c9e05d48/f6029c6a4e0544d082b97f00a385314f/FLAG07e6dc156 [2022-11-22 02:43:34,225 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/data/1c9e05d48/f6029c6a4e0544d082b97f00a385314f [2022-11-22 02:43:34,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:43:34,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:43:34,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:43:34,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:43:34,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:43:34,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:43:34" (1/1) ... [2022-11-22 02:43:34,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244905a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:34, skipping insertion in model container [2022-11-22 02:43:34,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:43:34" (1/1) ... [2022-11-22 02:43:34,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:43:34,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:43:34,846 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/sv-benchmarks/c/pthread/indexer.i[47556,47569] [2022-11-22 02:43:34,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:43:34,941 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:43:35,005 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/sv-benchmarks/c/pthread/indexer.i[47556,47569] [2022-11-22 02:43:35,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:43:35,072 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:43:35,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35 WrapperNode [2022-11-22 02:43:35,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:43:35,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:43:35,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:43:35,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:43:35,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,148 INFO L138 Inliner]: procedures = 269, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2022-11-22 02:43:35,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:43:35,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:43:35,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:43:35,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:43:35,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,201 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:43:35,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:43:35,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:43:35,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:43:35,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (1/1) ... [2022-11-22 02:43:35,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:43:35,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:35,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:43:35,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:43:35,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:43:35,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:43:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:43:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread_routine [2022-11-22 02:43:35,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_routine [2022-11-22 02:43:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:43:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 02:43:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:43:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:43:35,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:43:35,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:43:35,311 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 02:43:35,452 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:43:35,455 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:43:35,937 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:43:35,954 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:43:35,955 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-22 02:43:35,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:43:35 BoogieIcfgContainer [2022-11-22 02:43:35,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:43:35,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:43:35,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:43:35,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:43:35,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:43:34" (1/3) ... [2022-11-22 02:43:35,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5872286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:43:35, skipping insertion in model container [2022-11-22 02:43:35,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:43:35" (2/3) ... [2022-11-22 02:43:35,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5872286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:43:35, skipping insertion in model container [2022-11-22 02:43:35,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:43:35" (3/3) ... [2022-11-22 02:43:35,972 INFO L112 eAbstractionObserver]: Analyzing ICFG indexer.i [2022-11-22 02:43:35,983 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 02:43:35,994 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:43:35,995 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-11-22 02:43:35,995 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 02:43:36,217 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-22 02:43:36,268 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 02:43:36,300 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 155 transitions, 318 flow [2022-11-22 02:43:36,311 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 155 transitions, 318 flow [2022-11-22 02:43:36,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 155 transitions, 318 flow [2022-11-22 02:43:36,456 INFO L130 PetriNetUnfolder]: 18/193 cut-off events. [2022-11-22 02:43:36,457 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-22 02:43:36,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 193 events. 18/193 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 116. Up to 4 conditions per place. [2022-11-22 02:43:36,471 INFO L119 LiptonReduction]: Number of co-enabled transitions 6424 [2022-11-22 02:43:40,741 INFO L134 LiptonReduction]: Checked pairs total: 17574 [2022-11-22 02:43:40,741 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-22 02:43:40,750 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 54 transitions, 116 flow [2022-11-22 02:43:40,800 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:40,821 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:43:40,827 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45d4d104, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:43:40,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-11-22 02:43:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 02:43:40,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:40,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:40,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1669931068, now seen corresponding path program 1 times [2022-11-22 02:43:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:40,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094757679] [2022-11-22 02:43:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:41,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:41,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094757679] [2022-11-22 02:43:41,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094757679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:43:41,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:43:41,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:43:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609385230] [2022-11-22 02:43:41,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:43:41,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:43:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:43:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:43:41,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:43:41,140 INFO L87 Difference]: Start difference. First operand has 524 states, 502 states have (on average 2.1772908366533863) internal successors, (1093), 523 states have internal predecessors, (1093), 0 states have call successors, (0), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:41,298 INFO L93 Difference]: Finished difference Result 477 states and 948 transitions. [2022-11-22 02:43:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:43:41,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-22 02:43:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:41,319 INFO L225 Difference]: With dead ends: 477 [2022-11-22 02:43:41,319 INFO L226 Difference]: Without dead ends: 476 [2022-11-22 02:43:41,321 INFO L412 NwaCegarLoop]: 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 [2022-11-22 02:43:41,324 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:41,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:43:41,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-11-22 02:43:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2022-11-22 02:43:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 459 states have (on average 2.0631808278867103) internal successors, (947), 475 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 947 transitions. [2022-11-22 02:43:41,395 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 947 transitions. Word has length 8 [2022-11-22 02:43:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:41,396 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 947 transitions. [2022-11-22 02:43:41,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 947 transitions. [2022-11-22 02:43:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:43:41,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:41,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:41,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:43:41,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 370342283, now seen corresponding path program 1 times [2022-11-22 02:43:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:41,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179333601] [2022-11-22 02:43:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:41,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:41,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:41,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179333601] [2022-11-22 02:43:41,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179333601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:41,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756875630] [2022-11-22 02:43:41,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:41,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:41,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:41,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:41,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:43:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:41,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 02:43:41,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:41,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:43:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:41,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756875630] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:43:41,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328744022] [2022-11-22 02:43:41,754 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 02:43:41,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:43:41,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-22 02:43:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805562855] [2022-11-22 02:43:41,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:43:41,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:43:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:43:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:43:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:43:41,760 INFO L87 Difference]: Start difference. First operand 476 states and 947 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:41,877 INFO L93 Difference]: Finished difference Result 279 states and 542 transitions. [2022-11-22 02:43:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:43:41,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 9 [2022-11-22 02:43:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:41,880 INFO L225 Difference]: With dead ends: 279 [2022-11-22 02:43:41,880 INFO L226 Difference]: Without dead ends: 279 [2022-11-22 02:43:41,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:43:41,894 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 210 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:41,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 38 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:43:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-22 02:43:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-11-22 02:43:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 270 states have (on average 2.0074074074074075) internal successors, (542), 278 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 542 transitions. [2022-11-22 02:43:41,916 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 542 transitions. Word has length 9 [2022-11-22 02:43:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:41,916 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 542 transitions. [2022-11-22 02:43:41,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 542 transitions. [2022-11-22 02:43:41,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:43:41,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:41,922 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:41,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 02:43:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-22 02:43:42,123 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash 798136708, now seen corresponding path program 2 times [2022-11-22 02:43:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:42,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028265540] [2022-11-22 02:43:42,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:42,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:42,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:42,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028265540] [2022-11-22 02:43:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028265540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431479499] [2022-11-22 02:43:42,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:43:42,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:42,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:42,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:42,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:43:42,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:43:42,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:43:42,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 02:43:42,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:42,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:43:42,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:43:42,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:43:42,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:43:42,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:43:42,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:42,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:43:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:43:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:43:42,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:43:42,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:42,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:43:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-22 02:43:42,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:43:42,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431479499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:43:42,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:43:42,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2022-11-22 02:43:42,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036227966] [2022-11-22 02:43:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:43:42,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:43:42,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:43:42,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:43:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:43:42,787 INFO L87 Difference]: Start difference. First operand 279 states and 542 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:43,234 INFO L93 Difference]: Finished difference Result 364 states and 721 transitions. [2022-11-22 02:43:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:43:43,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 [2022-11-22 02:43:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:43,240 INFO L225 Difference]: With dead ends: 364 [2022-11-22 02:43:43,240 INFO L226 Difference]: Without dead ends: 364 [2022-11-22 02:43:43,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:43:43,242 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:43,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 16 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:43:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-22 02:43:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-11-22 02:43:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 356 states have (on average 2.0252808988764044) internal successors, (721), 363 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 721 transitions. [2022-11-22 02:43:43,263 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 721 transitions. Word has length 12 [2022-11-22 02:43:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:43,264 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 721 transitions. [2022-11-22 02:43:43,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 721 transitions. [2022-11-22 02:43:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:43:43,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:43,265 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:43,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:43:43,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:43,472 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread_routineErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1989071932, now seen corresponding path program 1 times [2022-11-22 02:43:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:43,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440047921] [2022-11-22 02:43:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:43,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:43,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440047921] [2022-11-22 02:43:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440047921] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205722618] [2022-11-22 02:43:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:43,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:43,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:43,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:43:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:43,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:43:43,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:43,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:43:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:43,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205722618] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:43:43,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367043142] [2022-11-22 02:43:43,856 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 02:43:43,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:43:43,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-22 02:43:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705510149] [2022-11-22 02:43:43,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:43:43,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 02:43:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:43:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 02:43:43,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:43:43,861 INFO L87 Difference]: Start difference. First operand 364 states and 721 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:43,960 INFO L93 Difference]: Finished difference Result 370 states and 727 transitions. [2022-11-22 02:43:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 02:43:43,960 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 20 [2022-11-22 02:43:43,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:43,963 INFO L225 Difference]: With dead ends: 370 [2022-11-22 02:43:43,963 INFO L226 Difference]: Without dead ends: 370 [2022-11-22 02:43:43,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:43:43,967 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 104 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:43,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 57 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:43:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-22 02:43:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-11-22 02:43:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 362 states have (on average 2.0082872928176796) internal successors, (727), 369 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 727 transitions. [2022-11-22 02:43:43,996 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 727 transitions. Word has length 20 [2022-11-22 02:43:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:43,997 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 727 transitions. [2022-11-22 02:43:43,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 727 transitions. [2022-11-22 02:43:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 02:43:43,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:43,999 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:44,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-22 02:43:44,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:44,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread_routineErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:44,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1440179932, now seen corresponding path program 2 times [2022-11-22 02:43:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:44,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102272406] [2022-11-22 02:43:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:44,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:44,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102272406] [2022-11-22 02:43:44,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102272406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:44,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080489369] [2022-11-22 02:43:44,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:43:44,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:44,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:44,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:43:44,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:43:44,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:43:44,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-22 02:43:44,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:44,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:43:44,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:43:44,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:44,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-22 02:43:44,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:44,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-11-22 02:43:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-22 02:43:44,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:43:44,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080489369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:43:44,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 02:43:44,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 17 [2022-11-22 02:43:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494166848] [2022-11-22 02:43:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:43:44,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:43:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:43:44,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:43:44,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:43:44,874 INFO L87 Difference]: Start difference. First operand 370 states and 727 transitions. Second operand has 6 states, 5 states have (on average 3.4) 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) [2022-11-22 02:43:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:45,130 INFO L93 Difference]: Finished difference Result 546 states and 1085 transitions. [2022-11-22 02:43:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:43:45,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) 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 26 [2022-11-22 02:43:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:45,134 INFO L225 Difference]: With dead ends: 546 [2022-11-22 02:43:45,134 INFO L226 Difference]: Without dead ends: 546 [2022-11-22 02:43:45,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:43:45,135 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:45,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 21 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:43:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-22 02:43:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 398. [2022-11-22 02:43:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 390 states have (on average 1.9974358974358974) internal successors, (779), 397 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 779 transitions. [2022-11-22 02:43:45,152 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 779 transitions. Word has length 26 [2022-11-22 02:43:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:45,152 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 779 transitions. [2022-11-22 02:43:45,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) 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) [2022-11-22 02:43:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 779 transitions. [2022-11-22 02:43:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 02:43:45,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:45,154 INFO L195 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:45,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:43:45,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:45,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2078697546, now seen corresponding path program 1 times [2022-11-22 02:43:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:45,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844629174] [2022-11-22 02:43:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:45,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844629174] [2022-11-22 02:43:45,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844629174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100114903] [2022-11-22 02:43:45,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:45,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:45,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:45,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:45,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:43:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:45,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 02:43:45,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:45,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:43:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:46,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100114903] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:43:46,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [850162139] [2022-11-22 02:43:46,064 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 02:43:46,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:43:46,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-11-22 02:43:46,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720378450] [2022-11-22 02:43:46,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:43:46,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 02:43:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:43:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 02:43:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:43:46,067 INFO L87 Difference]: Start difference. First operand 398 states and 779 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:46,175 INFO L93 Difference]: Finished difference Result 410 states and 791 transitions. [2022-11-22 02:43:46,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 02:43:46,175 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 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 29 [2022-11-22 02:43:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:46,178 INFO L225 Difference]: With dead ends: 410 [2022-11-22 02:43:46,178 INFO L226 Difference]: Without dead ends: 410 [2022-11-22 02:43:46,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:43:46,179 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 204 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:46,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 38 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:43:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-11-22 02:43:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-11-22 02:43:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 402 states have (on average 1.9676616915422886) internal successors, (791), 409 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 791 transitions. [2022-11-22 02:43:46,213 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 791 transitions. Word has length 29 [2022-11-22 02:43:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:46,214 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 791 transitions. [2022-11-22 02:43:46,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 791 transitions. [2022-11-22 02:43:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 02:43:46,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:46,221 INFO L195 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:46,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 02:43:46,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:46,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1317756150, now seen corresponding path program 2 times [2022-11-22 02:43:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:46,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280732319] [2022-11-22 02:43:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:47,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:47,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280732319] [2022-11-22 02:43:47,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280732319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:47,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400165424] [2022-11-22 02:43:47,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:43:47,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:47,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:47,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:47,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:43:53,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-11-22 02:43:53,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:43:53,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 02:43:53,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:53,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:43:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:54,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400165424] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:43:54,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [908520158] [2022-11-22 02:43:54,608 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 02:43:54,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:43:54,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-11-22 02:43:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402896723] [2022-11-22 02:43:54,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:43:54,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-22 02:43:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:43:54,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-22 02:43:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-22 02:43:54,614 INFO L87 Difference]: Start difference. First operand 410 states and 791 transitions. Second operand has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:54,813 INFO L93 Difference]: Finished difference Result 434 states and 815 transitions. [2022-11-22 02:43:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-22 02:43:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 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 41 [2022-11-22 02:43:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:54,816 INFO L225 Difference]: With dead ends: 434 [2022-11-22 02:43:54,816 INFO L226 Difference]: Without dead ends: 434 [2022-11-22 02:43:54,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-22 02:43:54,819 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 305 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:54,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 38 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:43:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-22 02:43:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-11-22 02:43:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 426 states have (on average 1.9131455399061033) internal successors, (815), 433 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 815 transitions. [2022-11-22 02:43:54,834 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 815 transitions. Word has length 41 [2022-11-22 02:43:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:54,834 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 815 transitions. [2022-11-22 02:43:54,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:43:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 815 transitions. [2022-11-22 02:43:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-22 02:43:54,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:54,840 INFO L195 NwaCegarLoop]: trace histogram [46, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:54,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:43:55,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-22 02:43:55,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:43:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1795508086, now seen corresponding path program 3 times [2022-11-22 02:43:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:55,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278936867] [2022-11-22 02:43:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:55,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:57,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:57,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278936867] [2022-11-22 02:43:57,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278936867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:57,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100552571] [2022-11-22 02:43:57,124 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:43:57,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:57,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:57,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:57,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:43:57,381 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:43:57,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:43:57,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-22 02:43:57,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:43:57,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:44:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1087 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:44:00,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100552571] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:44:00,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672213464] [2022-11-22 02:44:00,638 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 02:44:00,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:44:00,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2022-11-22 02:44:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455749550] [2022-11-22 02:44:00,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:44:00,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-22 02:44:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:44:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-22 02:44:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-22 02:44:00,645 INFO L87 Difference]: Start difference. First operand 434 states and 815 transitions. Second operand has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:44:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:44:00,942 INFO L93 Difference]: Finished difference Result 482 states and 863 transitions. [2022-11-22 02:44:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-22 02:44:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 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 65 [2022-11-22 02:44:00,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:44:00,949 INFO L225 Difference]: With dead ends: 482 [2022-11-22 02:44:00,949 INFO L226 Difference]: Without dead ends: 482 [2022-11-22 02:44:00,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-11-22 02:44:00,955 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 544 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:44:00,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 57 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:44:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-11-22 02:44:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-11-22 02:44:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 474 states have (on average 1.8206751054852321) internal successors, (863), 481 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:44:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 863 transitions. [2022-11-22 02:44:00,971 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 863 transitions. Word has length 65 [2022-11-22 02:44:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:44:00,973 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 863 transitions. [2022-11-22 02:44:00,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.134020618556701) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:44:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 863 transitions. [2022-11-22 02:44:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-22 02:44:00,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:44:00,976 INFO L195 NwaCegarLoop]: trace histogram [94, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:44:00,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:44:01,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:44:01,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:44:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:44:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1659724682, now seen corresponding path program 4 times [2022-11-22 02:44:01,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:44:01,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581786103] [2022-11-22 02:44:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:44:01,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:44:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:44:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:44:08,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:44:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581786103] [2022-11-22 02:44:08,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581786103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:44:08,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016602224] [2022-11-22 02:44:08,106 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 02:44:08,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:44:08,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:44:08,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:44:08,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:44:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:44:08,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-22 02:44:08,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:44:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:44:08,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:44:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4471 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-22 02:44:15,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016602224] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:44:15,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1941298572] [2022-11-22 02:44:15,774 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-22 02:44:15,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:44:15,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 130 [2022-11-22 02:44:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724212889] [2022-11-22 02:44:15,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:44:15,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-22 02:44:15,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:44:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-22 02:44:15,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2022-11-22 02:44:15,795 INFO L87 Difference]: Start difference. First operand 482 states and 863 transitions. Second operand has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:44:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:44:16,186 INFO L93 Difference]: Finished difference Result 516 states and 897 transitions. [2022-11-22 02:44:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-11-22 02:44:16,187 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 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 113 [2022-11-22 02:44:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:44:16,190 INFO L225 Difference]: With dead ends: 516 [2022-11-22 02:44:16,190 INFO L226 Difference]: Without dead ends: 516 [2022-11-22 02:44:16,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 129 SyntacticMatches, 62 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2022-11-22 02:44:16,195 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 581 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:44:16,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 38 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:44:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-11-22 02:44:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2022-11-22 02:44:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 508 states have (on average 1.765748031496063) internal successors, (897), 515 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:44:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 897 transitions. [2022-11-22 02:44:16,211 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 897 transitions. Word has length 113 [2022-11-22 02:44:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:44:16,212 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 897 transitions. [2022-11-22 02:44:16,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 1.1068702290076335) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:44:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 897 transitions. [2022-11-22 02:44:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-22 02:44:16,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:44:16,214 INFO L195 NwaCegarLoop]: trace histogram [128, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:44:16,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:44:16,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:44:16,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread_routineErr0ASSERT_VIOLATIONDATA_RACE, thread_routineErr1ASSERT_VIOLATIONDATA_RACE, thread_routineErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-11-22 02:44:16,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:44:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1377003350, now seen corresponding path program 5 times [2022-11-22 02:44:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:44:16,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620146421] [2022-11-22 02:44:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:44:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:44:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:44:16,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 02:44:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:44:17,011 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 02:44:17,012 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 02:44:17,013 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-11-22 02:44:17,017 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-11-22 02:44:17,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-11-22 02:44:17,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-11-22 02:44:17,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2022-11-22 02:44:17,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-11-22 02:44:17,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-11-22 02:44:17,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-11-22 02:44:17,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread_routineErr2ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-11-22 02:44:17,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:44:17,022 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1] [2022-11-22 02:44:17,030 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 02:44:17,031 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:44:17,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:44:17 BasicIcfg [2022-11-22 02:44:17,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:44:17,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:44:17,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:44:17,201 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:44:17,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:43:35" (3/4) ... [2022-11-22 02:44:17,205 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 02:44:17,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:44:17,206 INFO L158 Benchmark]: Toolchain (without parser) took 42976.75ms. Allocated memory was 151.0MB in the beginning and 352.3MB in the end (delta: 201.3MB). Free memory was 113.9MB in the beginning and 110.1MB in the end (delta: 3.8MB). Peak memory consumption was 207.3MB. Max. memory is 16.1GB. [2022-11-22 02:44:17,206 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:44:17,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 843.21ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 81.9MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-22 02:44:17,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.54ms. Allocated memory is still 151.0MB. Free memory was 81.9MB in the beginning and 78.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:44:17,213 INFO L158 Benchmark]: Boogie Preprocessor took 42.55ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:44:17,214 INFO L158 Benchmark]: RCFGBuilder took 751.11ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 57.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-22 02:44:17,214 INFO L158 Benchmark]: TraceAbstraction took 41240.25ms. Allocated memory was 151.0MB in the beginning and 352.3MB in the end (delta: 201.3MB). Free memory was 56.8MB in the beginning and 110.1MB in the end (delta: -53.3MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2022-11-22 02:44:17,215 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 352.3MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:44:17,216 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 843.21ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 81.9MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.54ms. Allocated memory is still 151.0MB. Free memory was 81.9MB in the beginning and 78.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.55ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 76.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 751.11ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 57.3MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41240.25ms. Allocated memory was 151.0MB in the beginning and 352.3MB in the end (delta: 201.3MB). Free memory was 56.8MB in the beginning and 110.1MB in the end (delta: -53.3MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 352.3MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 144 PlacesBefore, 50 PlacesAfterwards, 155 TransitionsBefore, 54 TransitionsAfterwards, 6424 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 115 TotalNumberOfCompositions, 17574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5805, independent: 5340, independent conditional: 0, independent unconditional: 5340, dependent: 465, dependent conditional: 0, dependent unconditional: 465, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3792, independent: 3664, independent conditional: 0, independent unconditional: 3664, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3792, independent: 3597, independent conditional: 0, independent unconditional: 3597, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 195, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 622, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 438, dependent conditional: 0, dependent unconditional: 438, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5805, independent: 1676, independent conditional: 0, independent unconditional: 1676, dependent: 337, dependent conditional: 0, dependent unconditional: 337, unknown: 3792, unknown conditional: 0, unknown unconditional: 3792] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 332, Positive conditional cache size: 0, Positive unconditional cache size: 332, Negative cache size: 84, Negative conditional cache size: 0, Negative unconditional cache size: 84, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1043]: Data race detected Data race detected The following path leads to a data race: [L1000] 0 int table[128]; [L1001] 0 pthread_mutex_t cas_mutex[128]; [L1002] 0 pthread_t tids[13]; [L1039] 0 int i, arg; [L1040] 0 i = 0 VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=2, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=3, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=4, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=5, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=6, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=7, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=8, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=9, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=10, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=11, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=12, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=13, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=14, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=15, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=16, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=17, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=18, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=19, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=20, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=21, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=22, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=23, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=24, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=25, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=26, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=27, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=28, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=29, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=30, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=31, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=32, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=33, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=34, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=35, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=36, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=37, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=38, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=39, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=40, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=41, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=42, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=43, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=44, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=45, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=46, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=47, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=48, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=49, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=50, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=51, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=52, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=53, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=54, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=55, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=56, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=57, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=58, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=59, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=60, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=61, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=62, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=63, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=64, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=65, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=66, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=67, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=68, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=69, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=70, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=71, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=72, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=73, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=74, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=75, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=76, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=77, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=78, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=79, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=80, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=81, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=82, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=83, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=84, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=85, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=86, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=87, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=88, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=89, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=90, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=91, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=92, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=93, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=94, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=95, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=96, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=97, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=98, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=99, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=100, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=101, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=102, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=103, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=104, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=105, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=106, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=107, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=108, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=109, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=110, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=111, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=112, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=113, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=114, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=115, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=116, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=117, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=118, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=119, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=120, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=121, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=122, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=123, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=124, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=125, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=126, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=127, table={3:0}, tids={5:0}] [L1040] COND TRUE 0 i < 128 [L1040] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=128, table={3:0}, tids={5:0}] [L1040] COND FALSE 0 !(i < 128) [L1042] 0 i = 0 VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={3:0}, tids={5:0}] [L1042] COND TRUE 0 i < 13 [L1043] 0 arg=i VAL [arg={6:0}, cas_mutex={4:0}, i=0, table={3:0}, tids={5:0}] [L1044] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), thread_routine, &arg) VAL [arg={6:0}, cas_mutex={4:0}, i=0, pthread_create(&tids[i], ((void *)0), thread_routine, &arg)=-1, table={3:0}, tids={5:0}] [L1016] 1 int tid; [L1017] 1 int m = 0, w, h; [L1018] EXPR 1 \read(*arg) VAL [\read(*arg)=0, arg={6:0}, arg={6:0}, cas_mutex={4:0}, m=0, table={3:0}, tids={5:0}] [L1042] 0 i++ VAL [arg={6:0}, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] [L1042] COND TRUE 0 i < 13 [L1043] 0 arg=i VAL [arg={6:0}, arg=i=3074, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] [L1018] 1 tid = *((int *)arg) VAL [\read(*arg)=0, arg={6:0}, arg={6:0}, cas_mutex={4:0}, m=0, table={3:0}, tids={5:0}] [L1043] 0 arg=i VAL [arg={6:0}, arg=i=3074, cas_mutex={4:0}, i=1, table={3:0}, tids={5:0}] Now there is a data race (on the heap) between C: tid = *((int *)arg) [1018] and C: arg=i [1043] - UnprovableResult [Line: 1018]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 209 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 40.8s, OverallIterations: 10, TraceHistogramMax: 128, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2128 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2128 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1095 IncrementalHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 163 mSDtfsCounter, 1095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 389 SyntacticMatches, 62 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4705 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=0, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 148 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 785 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 2213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2255 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 137/17797 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-22 02:44:17,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77aace1e-5faf-49f6-b730-2f49b44e700d/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE