./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI --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 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 --- 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-5e519f3 [2022-11-03 03:32:57,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:32:57,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:32:57,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:32:57,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:32:57,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:32:57,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:32:57,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:32:57,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:32:57,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:32:57,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:32:57,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:32:57,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:32:57,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:32:57,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:32:57,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:32:57,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:32:57,351 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:32:57,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:32:57,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:32:57,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:32:57,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:32:57,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:32:57,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:32:57,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:32:57,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:32:57,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:32:57,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:32:57,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:32:57,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:32:57,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:32:57,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:32:57,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:32:57,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:32:57,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:32:57,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:32:57,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:32:57,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:32:57,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:32:57,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:32:57,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:32:57,398 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 03:32:57,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:32:57,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:32:57,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:32:57,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:32:57,449 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:32:57,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:32:57,450 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:32:57,450 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:32:57,450 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:32:57,451 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:32:57,452 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:32:57,452 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:32:57,453 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:32:57,453 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:32:57,453 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:32:57,453 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:32:57,454 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:32:57,454 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:32:57,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:32:57,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:32:57,455 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:32:57,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:32:57,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:32:57,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:32:57,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:32:57,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:32:57,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:32:57,459 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 03:32:57,459 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:32:57,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:32:57,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:32:57,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:32:57,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:32:57,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:32:57,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:32:57,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:32:57,461 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:32:57,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:32:57,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:32:57,462 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:32:57,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:32:57,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:32:57,463 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:32:57,463 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_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/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_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI 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 -> 3e185f9c0dac86cdbb29caae2de39811a090d813c08c4c3552062c2aa77b8788 [2022-11-03 03:32:57,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:32:57,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:32:57,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:32:57,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:32:57,786 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:32:57,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2022-11-03 03:32:57,867 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/data/8837118bb/397d72a43389405d84e8f2d14b9d359f/FLAGa7d4a9ca8 [2022-11-03 03:32:58,397 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:32:58,397 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2022-11-03 03:32:58,405 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/data/8837118bb/397d72a43389405d84e8f2d14b9d359f/FLAGa7d4a9ca8 [2022-11-03 03:32:58,734 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/data/8837118bb/397d72a43389405d84e8f2d14b9d359f [2022-11-03 03:32:58,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:32:58,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:32:58,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:32:58,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:32:58,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:32:58,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:32:58" (1/1) ... [2022-11-03 03:32:58,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc6f192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:58, skipping insertion in model container [2022-11-03 03:32:58,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:32:58" (1/1) ... [2022-11-03 03:32:58,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:32:58,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:32:59,055 WARN L230 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_889d9800-5d83-46cb-846f-c91f45d4da44/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c[2815,2828] [2022-11-03 03:32:59,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:32:59,076 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:32:59,125 WARN L230 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_889d9800-5d83-46cb-846f-c91f45d4da44/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c[2815,2828] [2022-11-03 03:32:59,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:32:59,162 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:32:59,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59 WrapperNode [2022-11-03 03:32:59,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:32:59,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:32:59,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:32:59,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:32:59,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,250 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 371 [2022-11-03 03:32:59,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:32:59,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:32:59,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:32:59,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:32:59,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,349 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:32:59,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:32:59,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:32:59,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:32:59,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (1/1) ... [2022-11-03 03:32:59,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:32:59,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:32:59,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:32:59,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:32:59,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:32:59,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:32:59,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:32:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:32:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:32:59,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:32:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:32:59,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:32:59,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:32:59,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:32:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:32:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:32:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:32:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:32:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:32:59,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:32:59,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:32:59,518 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:32:59,679 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:32:59,682 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:33:00,703 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:33:00,987 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:33:00,987 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-03 03:33:00,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:33:00 BoogieIcfgContainer [2022-11-03 03:33:00,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:33:00,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:33:00,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:33:00,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:33:00,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:32:58" (1/3) ... [2022-11-03 03:33:01,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677be13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:33:01, skipping insertion in model container [2022-11-03 03:33:01,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:32:59" (2/3) ... [2022-11-03 03:33:01,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677be13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:33:01, skipping insertion in model container [2022-11-03 03:33:01,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:33:00" (3/3) ... [2022-11-03 03:33:01,008 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2022-11-03 03:33:01,019 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:33:01,031 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:33:01,031 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-11-03 03:33:01,031 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:33:01,178 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 03:33:01,239 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:33:01,254 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-03 03:33:01,257 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 511 places, 528 transitions, 1080 flow [2022-11-03 03:33:01,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 511 places, 528 transitions, 1080 flow [2022-11-03 03:33:01,484 INFO L130 PetriNetUnfolder]: 27/525 cut-off events. [2022-11-03 03:33:01,485 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 03:33:01,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 525 events. 27/525 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 619 event pairs, 0 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 421. Up to 3 conditions per place. [2022-11-03 03:33:01,507 INFO L118 LiptonReduction]: Number of co-enabled transitions 13362 [2022-11-03 03:36:43,497 INFO L133 LiptonReduction]: Checked pairs total: 94810 [2022-11-03 03:36:43,498 INFO L135 LiptonReduction]: Total number of compositions: 655 [2022-11-03 03:36:43,508 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 132 transitions, 288 flow [2022-11-03 03:36:46,348 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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-03 03:36:46,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:36:46,420 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;@441ac458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:36:46,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2022-11-03 03:36:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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-03 03:36:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-03 03:36:46,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:46,599 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-03 03:36:46,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:36:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:46,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2175, now seen corresponding path program 1 times [2022-11-03 03:36:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:46,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196579811] [2022-11-03 03:36:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:46,923 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-03 03:36:46,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:46,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196579811] [2022-11-03 03:36:46,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196579811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:46,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:46,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-03 03:36:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483732169] [2022-11-03 03:36:46,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:46,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 03:36:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:46,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 03:36:46,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:36:47,082 INFO L87 Difference]: Start difference. First operand has 52279 states, 49896 states have (on average 4.336640211640212) internal successors, (216381), 52278 states have internal predecessors, (216381), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-03 03:36:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:47,563 INFO L93 Difference]: Finished difference Result 5616 states and 22643 transitions. [2022-11-03 03:36:47,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 03:36:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-03 03:36:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:47,643 INFO L225 Difference]: With dead ends: 5616 [2022-11-03 03:36:47,643 INFO L226 Difference]: Without dead ends: 5585 [2022-11-03 03:36:47,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:36:47,648 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:47,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5585 states. [2022-11-03 03:36:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5585 to 5585. [2022-11-03 03:36:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5573 states have (on average 4.047371254261619) internal successors, (22556), 5584 states have internal predecessors, (22556), 0 states have call successors, (0), 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-03 03:36:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 22556 transitions. [2022-11-03 03:36:48,097 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 22556 transitions. Word has length 1 [2022-11-03 03:36:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:48,098 INFO L495 AbstractCegarLoop]: Abstraction has 5585 states and 22556 transitions. [2022-11-03 03:36:48,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-03 03:36:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 22556 transitions. [2022-11-03 03:36:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:36:48,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:48,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:48,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:36:48,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:36:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1304631907, now seen corresponding path program 1 times [2022-11-03 03:36:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:48,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888130748] [2022-11-03 03:36:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:48,676 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-03 03:36:48,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:48,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888130748] [2022-11-03 03:36:48,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888130748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:48,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:48,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:36:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33037019] [2022-11-03 03:36:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:48,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:36:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:36:48,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:36:48,680 INFO L87 Difference]: Start difference. First operand 5585 states and 22556 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-03 03:36:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:49,291 INFO L93 Difference]: Finished difference Result 5586 states and 22557 transitions. [2022-11-03 03:36:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:36:49,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-03 03:36:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:49,353 INFO L225 Difference]: With dead ends: 5586 [2022-11-03 03:36:49,353 INFO L226 Difference]: Without dead ends: 5586 [2022-11-03 03:36:49,353 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-03 03:36:49,356 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:49,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:36:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-11-03 03:36:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 5586. [2022-11-03 03:36:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5586 states, 5574 states have (on average 4.046824542518838) internal successors, (22557), 5585 states have internal predecessors, (22557), 0 states have call successors, (0), 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-03 03:36:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5586 states to 5586 states and 22557 transitions. [2022-11-03 03:36:49,597 INFO L78 Accepts]: Start accepts. Automaton has 5586 states and 22557 transitions. Word has length 13 [2022-11-03 03:36:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:49,598 INFO L495 AbstractCegarLoop]: Abstraction has 5586 states and 22557 transitions. [2022-11-03 03:36:49,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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-03 03:36:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5586 states and 22557 transitions. [2022-11-03 03:36:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 03:36:49,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:49,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:49,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:36:49,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:36:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2019257060, now seen corresponding path program 1 times [2022-11-03 03:36:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:49,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559535936] [2022-11-03 03:36:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:50,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:50,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559535936] [2022-11-03 03:36:50,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559535936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:50,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:50,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:36:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720384689] [2022-11-03 03:36:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:50,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:50,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:50,773 INFO L87 Difference]: Start difference. First operand 5586 states and 22557 transitions. Second operand has 6 states, 5 states have (on average 2.8) 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-03 03:36:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:53,523 INFO L93 Difference]: Finished difference Result 9026 states and 36659 transitions. [2022-11-03 03:36:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:36:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) 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 14 [2022-11-03 03:36:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:53,604 INFO L225 Difference]: With dead ends: 9026 [2022-11-03 03:36:53,604 INFO L226 Difference]: Without dead ends: 9026 [2022-11-03 03:36:53,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:53,609 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:53,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 71 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-03 03:36:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9026 states. [2022-11-03 03:36:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9026 to 6506. [2022-11-03 03:36:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6506 states, 6494 states have (on average 4.064213119802895) internal successors, (26393), 6505 states have internal predecessors, (26393), 0 states have call successors, (0), 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-03 03:36:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6506 states to 6506 states and 26393 transitions. [2022-11-03 03:36:54,044 INFO L78 Accepts]: Start accepts. Automaton has 6506 states and 26393 transitions. Word has length 14 [2022-11-03 03:36:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:54,044 INFO L495 AbstractCegarLoop]: Abstraction has 6506 states and 26393 transitions. [2022-11-03 03:36:54,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) 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-03 03:36:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 6506 states and 26393 transitions. [2022-11-03 03:36:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:36:54,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:54,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:36:54,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:36:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1827556102, now seen corresponding path program 1 times [2022-11-03 03:36:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:54,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36877364] [2022-11-03 03:36:54,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:54,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:54,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:54,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36877364] [2022-11-03 03:36:54,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36877364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:54,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:54,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:36:54,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184075250] [2022-11-03 03:36:54,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:54,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:36:54,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:36:54,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:36:54,154 INFO L87 Difference]: Start difference. First operand 6506 states and 26393 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-03 03:36:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:54,746 INFO L93 Difference]: Finished difference Result 10116 states and 41047 transitions. [2022-11-03 03:36:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:36:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 03:36:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:54,951 INFO L225 Difference]: With dead ends: 10116 [2022-11-03 03:36:54,951 INFO L226 Difference]: Without dead ends: 10116 [2022-11-03 03:36:54,952 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-03 03:36:54,952 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 57 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:54,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 91 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:36:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10116 states. [2022-11-03 03:36:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10116 to 6336. [2022-11-03 03:36:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6336 states, 6326 states have (on average 4.064653809674359) internal successors, (25713), 6335 states have internal predecessors, (25713), 0 states have call successors, (0), 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-03 03:36:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6336 states to 6336 states and 25713 transitions. [2022-11-03 03:36:55,241 INFO L78 Accepts]: Start accepts. Automaton has 6336 states and 25713 transitions. Word has length 15 [2022-11-03 03:36:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:55,241 INFO L495 AbstractCegarLoop]: Abstraction has 6336 states and 25713 transitions. [2022-11-03 03:36:55,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-03 03:36:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 6336 states and 25713 transitions. [2022-11-03 03:36:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:36:55,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:55,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:55,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:36:55,244 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:36:55,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 440232106, now seen corresponding path program 1 times [2022-11-03 03:36:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:55,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178158343] [2022-11-03 03:36:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:36:55,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:55,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178158343] [2022-11-03 03:36:55,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178158343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:55,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:55,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:36:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670774293] [2022-11-03 03:36:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:55,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:36:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:36:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:36:55,565 INFO L87 Difference]: Start difference. First operand 6336 states and 25713 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-03 03:36:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:56,022 INFO L93 Difference]: Finished difference Result 6338 states and 25715 transitions. [2022-11-03 03:36:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:36:56,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-03 03:36:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:56,066 INFO L225 Difference]: With dead ends: 6338 [2022-11-03 03:36:56,066 INFO L226 Difference]: Without dead ends: 6338 [2022-11-03 03:36:56,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:36:56,068 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:56,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 76 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:36:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2022-11-03 03:36:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6338. [2022-11-03 03:36:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6328 states have (on average 4.063685208596713) internal successors, (25715), 6337 states have internal predecessors, (25715), 0 states have call successors, (0), 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-03 03:36:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 25715 transitions. [2022-11-03 03:36:56,401 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 25715 transitions. Word has length 16 [2022-11-03 03:36:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:56,402 INFO L495 AbstractCegarLoop]: Abstraction has 6338 states and 25715 transitions. [2022-11-03 03:36:56,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-03 03:36:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 25715 transitions. [2022-11-03 03:36:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:36:56,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:56,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:56,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:36:56,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:36:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 685065570, now seen corresponding path program 1 times [2022-11-03 03:36:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:56,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460997843] [2022-11-03 03:36:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:56,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:36:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:36:57,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:36:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460997843] [2022-11-03 03:36:57,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460997843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:36:57,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:36:57,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:36:57,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025203850] [2022-11-03 03:36:57,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:36:57,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:36:57,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:36:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:36:57,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:57,155 INFO L87 Difference]: Start difference. First operand 6338 states and 25715 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:36:59,338 INFO L93 Difference]: Finished difference Result 9223 states and 37357 transitions. [2022-11-03 03:36:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:36:59,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 03:36:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:36:59,389 INFO L225 Difference]: With dead ends: 9223 [2022-11-03 03:36:59,389 INFO L226 Difference]: Without dead ends: 9223 [2022-11-03 03:36:59,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:36:59,391 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 112 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:36:59,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 83 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-03 03:36:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2022-11-03 03:36:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 8533. [2022-11-03 03:36:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8533 states, 8523 states have (on average 4.118737533732254) internal successors, (35104), 8532 states have internal predecessors, (35104), 0 states have call successors, (0), 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-03 03:36:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 35104 transitions. [2022-11-03 03:36:59,709 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 35104 transitions. Word has length 18 [2022-11-03 03:36:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:36:59,711 INFO L495 AbstractCegarLoop]: Abstraction has 8533 states and 35104 transitions. [2022-11-03 03:36:59,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:36:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 35104 transitions. [2022-11-03 03:36:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:36:59,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:36:59,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:36:59,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:36:59,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:36:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:36:59,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1155853880, now seen corresponding path program 1 times [2022-11-03 03:36:59,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:36:59,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070981659] [2022-11-03 03:36:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:36:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:36:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:37:00,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:00,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070981659] [2022-11-03 03:37:00,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070981659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:00,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406595210] [2022-11-03 03:37:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:00,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:00,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:00,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:00,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:37:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:00,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:37:00,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:37:00,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:37:00,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406595210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:00,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [927145331] [2022-11-03 03:37:00,878 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-03 03:37:00,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:00,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-03 03:37:00,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102828252] [2022-11-03 03:37:00,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:00,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 03:37:00,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:00,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 03:37:00,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:37:00,888 INFO L87 Difference]: Start difference. First operand 8533 states and 35104 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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-03 03:37:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:02,737 INFO L93 Difference]: Finished difference Result 17524 states and 68970 transitions. [2022-11-03 03:37:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:37:02,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 03:37:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:02,829 INFO L225 Difference]: With dead ends: 17524 [2022-11-03 03:37:02,829 INFO L226 Difference]: Without dead ends: 17524 [2022-11-03 03:37:02,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:37:02,831 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 564 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:02,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 617 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 03:37:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17524 states. [2022-11-03 03:37:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17524 to 11923. [2022-11-03 03:37:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11923 states, 11913 states have (on average 4.085536808528499) internal successors, (48671), 11922 states have internal predecessors, (48671), 0 states have call successors, (0), 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-03 03:37:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11923 states to 11923 states and 48671 transitions. [2022-11-03 03:37:03,568 INFO L78 Accepts]: Start accepts. Automaton has 11923 states and 48671 transitions. Word has length 21 [2022-11-03 03:37:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:03,570 INFO L495 AbstractCegarLoop]: Abstraction has 11923 states and 48671 transitions. [2022-11-03 03:37:03,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 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-03 03:37:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 11923 states and 48671 transitions. [2022-11-03 03:37:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:37:03,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:03,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:03,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:03,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:03,799 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1295492584, now seen corresponding path program 1 times [2022-11-03 03:37:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:03,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664946125] [2022-11-03 03:37:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:37:04,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:04,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664946125] [2022-11-03 03:37:04,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664946125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:04,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40530690] [2022-11-03 03:37:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:04,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:04,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:04,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:04,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:37:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:04,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:37:04,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:37:04,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:37:04,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40530690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:04,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1877423917] [2022-11-03 03:37:04,810 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-03 03:37:04,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:04,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-03 03:37:04,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331585337] [2022-11-03 03:37:04,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:04,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 03:37:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:04,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 03:37:04,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:37:04,813 INFO L87 Difference]: Start difference. First operand 11923 states and 48671 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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-03 03:37:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:06,461 INFO L93 Difference]: Finished difference Result 10024 states and 40120 transitions. [2022-11-03 03:37:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:37:06,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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 22 [2022-11-03 03:37:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:06,494 INFO L225 Difference]: With dead ends: 10024 [2022-11-03 03:37:06,494 INFO L226 Difference]: Without dead ends: 10024 [2022-11-03 03:37:06,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:37:06,495 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 389 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:06,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 276 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 03:37:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10024 states. [2022-11-03 03:37:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10024 to 9209. [2022-11-03 03:37:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9209 states, 9199 states have (on average 4.072725296227851) internal successors, (37465), 9208 states have internal predecessors, (37465), 0 states have call successors, (0), 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-03 03:37:06,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9209 states to 9209 states and 37465 transitions. [2022-11-03 03:37:06,969 INFO L78 Accepts]: Start accepts. Automaton has 9209 states and 37465 transitions. Word has length 22 [2022-11-03 03:37:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:06,969 INFO L495 AbstractCegarLoop]: Abstraction has 9209 states and 37465 transitions. [2022-11-03 03:37:06,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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-03 03:37:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9209 states and 37465 transitions. [2022-11-03 03:37:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:37:06,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:06,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:07,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:07,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:07,181 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1091490153, now seen corresponding path program 2 times [2022-11-03 03:37:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:07,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555902688] [2022-11-03 03:37:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:37:08,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:08,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555902688] [2022-11-03 03:37:08,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555902688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:08,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:08,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:37:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013936039] [2022-11-03 03:37:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:08,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:37:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:37:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:37:08,519 INFO L87 Difference]: Start difference. First operand 9209 states and 37465 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 03:37:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:10,654 INFO L93 Difference]: Finished difference Result 8624 states and 34963 transitions. [2022-11-03 03:37:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:37:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 24 [2022-11-03 03:37:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:10,682 INFO L225 Difference]: With dead ends: 8624 [2022-11-03 03:37:10,682 INFO L226 Difference]: Without dead ends: 8624 [2022-11-03 03:37:10,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:37:10,683 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 350 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:10,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 78 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-03 03:37:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8624 states. [2022-11-03 03:37:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8624 to 6284. [2022-11-03 03:37:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6284 states, 6279 states have (on average 3.9743589743589745) internal successors, (24955), 6283 states have internal predecessors, (24955), 0 states have call successors, (0), 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-03 03:37:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6284 states to 6284 states and 24955 transitions. [2022-11-03 03:37:11,026 INFO L78 Accepts]: Start accepts. Automaton has 6284 states and 24955 transitions. Word has length 24 [2022-11-03 03:37:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:11,027 INFO L495 AbstractCegarLoop]: Abstraction has 6284 states and 24955 transitions. [2022-11-03 03:37:11,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 03:37:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6284 states and 24955 transitions. [2022-11-03 03:37:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:37:11,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:11,033 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:11,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:37:11,034 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:11,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1710759478, now seen corresponding path program 1 times [2022-11-03 03:37:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:11,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899170446] [2022-11-03 03:37:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:37:13,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899170446] [2022-11-03 03:37:13,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899170446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:13,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:13,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:37:13,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212287112] [2022-11-03 03:37:13,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:13,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:37:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:37:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:37:13,733 INFO L87 Difference]: Start difference. First operand 6284 states and 24955 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 03:37:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:15,942 INFO L93 Difference]: Finished difference Result 17288 states and 69292 transitions. [2022-11-03 03:37:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:37:15,942 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 24 [2022-11-03 03:37:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:15,996 INFO L225 Difference]: With dead ends: 17288 [2022-11-03 03:37:15,996 INFO L226 Difference]: Without dead ends: 17288 [2022-11-03 03:37:15,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:37:15,997 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 334 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:15,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 111 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-03 03:37:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17288 states. [2022-11-03 03:37:16,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17288 to 7320. [2022-11-03 03:37:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7320 states, 7315 states have (on average 4.0690362269309635) internal successors, (29765), 7319 states have internal predecessors, (29765), 0 states have call successors, (0), 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-03 03:37:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7320 states to 7320 states and 29765 transitions. [2022-11-03 03:37:16,319 INFO L78 Accepts]: Start accepts. Automaton has 7320 states and 29765 transitions. Word has length 24 [2022-11-03 03:37:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:16,320 INFO L495 AbstractCegarLoop]: Abstraction has 7320 states and 29765 transitions. [2022-11-03 03:37:16,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 03:37:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7320 states and 29765 transitions. [2022-11-03 03:37:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:37:16,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:16,329 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:16,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:37:16,329 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1770217258, now seen corresponding path program 2 times [2022-11-03 03:37:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:16,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451231105] [2022-11-03 03:37:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:37:18,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:18,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451231105] [2022-11-03 03:37:18,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451231105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:18,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:18,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:37:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735492757] [2022-11-03 03:37:18,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:18,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:37:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:18,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:37:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:37:18,409 INFO L87 Difference]: Start difference. First operand 7320 states and 29765 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 03:37:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:20,448 INFO L93 Difference]: Finished difference Result 17675 states and 71444 transitions. [2022-11-03 03:37:20,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:37:20,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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 24 [2022-11-03 03:37:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:20,514 INFO L225 Difference]: With dead ends: 17675 [2022-11-03 03:37:20,514 INFO L226 Difference]: Without dead ends: 17675 [2022-11-03 03:37:20,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:37:20,515 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 502 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:20,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 101 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 03:37:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17675 states. [2022-11-03 03:37:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17675 to 8641. [2022-11-03 03:37:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8641 states, 8636 states have (on average 4.142890226956925) internal successors, (35778), 8640 states have internal predecessors, (35778), 0 states have call successors, (0), 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-03 03:37:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8641 states to 8641 states and 35778 transitions. [2022-11-03 03:37:20,939 INFO L78 Accepts]: Start accepts. Automaton has 8641 states and 35778 transitions. Word has length 24 [2022-11-03 03:37:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:20,939 INFO L495 AbstractCegarLoop]: Abstraction has 8641 states and 35778 transitions. [2022-11-03 03:37:20,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 03:37:20,939 INFO L276 IsEmpty]: Start isEmpty. Operand 8641 states and 35778 transitions. [2022-11-03 03:37:20,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:37:20,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:20,946 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:20,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:37:20,946 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:20,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash -699782953, now seen corresponding path program 2 times [2022-11-03 03:37:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:20,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156678828] [2022-11-03 03:37:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:37:21,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:21,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156678828] [2022-11-03 03:37:21,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156678828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:21,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:21,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:37:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769191795] [2022-11-03 03:37:21,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:21,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:21,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:21,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:21,451 INFO L87 Difference]: Start difference. First operand 8641 states and 35778 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:22,854 INFO L93 Difference]: Finished difference Result 10006 states and 41357 transitions. [2022-11-03 03:37:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:22,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 03:37:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:22,885 INFO L225 Difference]: With dead ends: 10006 [2022-11-03 03:37:22,885 INFO L226 Difference]: Without dead ends: 10006 [2022-11-03 03:37:22,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:22,886 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:22,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 66 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 03:37:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2022-11-03 03:37:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 9451. [2022-11-03 03:37:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9451 states, 9446 states have (on average 4.143235231844167) internal successors, (39137), 9450 states have internal predecessors, (39137), 0 states have call successors, (0), 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-03 03:37:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9451 states to 9451 states and 39137 transitions. [2022-11-03 03:37:23,096 INFO L78 Accepts]: Start accepts. Automaton has 9451 states and 39137 transitions. Word has length 25 [2022-11-03 03:37:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:23,097 INFO L495 AbstractCegarLoop]: Abstraction has 9451 states and 39137 transitions. [2022-11-03 03:37:23,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 9451 states and 39137 transitions. [2022-11-03 03:37:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:37:23,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:23,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:23,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:37:23,103 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:23,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash -70595945, now seen corresponding path program 3 times [2022-11-03 03:37:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:23,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57248727] [2022-11-03 03:37:23,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:23,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:37:23,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57248727] [2022-11-03 03:37:23,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57248727] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:23,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040169717] [2022-11-03 03:37:23,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:37:23,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:23,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:23,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:23,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:37:23,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:37:23,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:23,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:37:23,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:37:24,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:37:24,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040169717] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1391022146] [2022-11-03 03:37:24,272 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-03 03:37:24,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:24,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-03 03:37:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861859022] [2022-11-03 03:37:24,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:24,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:37:24,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:37:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:37:24,280 INFO L87 Difference]: Start difference. First operand 9451 states and 39137 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:27,150 INFO L93 Difference]: Finished difference Result 35800 states and 142938 transitions. [2022-11-03 03:37:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 03:37:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:37:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:27,462 INFO L225 Difference]: With dead ends: 35800 [2022-11-03 03:37:27,462 INFO L226 Difference]: Without dead ends: 35800 [2022-11-03 03:37:27,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=565, Unknown=0, NotChecked=0, Total=812 [2022-11-03 03:37:27,463 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1127 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:27,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1062 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 03:37:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35800 states. [2022-11-03 03:37:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35800 to 17490. [2022-11-03 03:37:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17490 states, 17485 states have (on average 4.195767800972262) internal successors, (73363), 17489 states have internal predecessors, (73363), 0 states have call successors, (0), 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-03 03:37:28,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17490 states to 17490 states and 73363 transitions. [2022-11-03 03:37:28,029 INFO L78 Accepts]: Start accepts. Automaton has 17490 states and 73363 transitions. Word has length 26 [2022-11-03 03:37:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:28,030 INFO L495 AbstractCegarLoop]: Abstraction has 17490 states and 73363 transitions. [2022-11-03 03:37:28,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:37:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 17490 states and 73363 transitions. [2022-11-03 03:37:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:37:28,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:28,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:28,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:28,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:37:28,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:28,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1144070471, now seen corresponding path program 1 times [2022-11-03 03:37:28,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:28,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129081465] [2022-11-03 03:37:28,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:37:28,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:28,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129081465] [2022-11-03 03:37:28,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129081465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:37:28,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:37:28,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:37:28,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059289685] [2022-11-03 03:37:28,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:37:28,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:37:28,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:28,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:37:28,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:28,796 INFO L87 Difference]: Start difference. First operand 17490 states and 73363 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-03 03:37:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:30,606 INFO L93 Difference]: Finished difference Result 17565 states and 73573 transitions. [2022-11-03 03:37:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:37:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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 28 [2022-11-03 03:37:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:30,675 INFO L225 Difference]: With dead ends: 17565 [2022-11-03 03:37:30,676 INFO L226 Difference]: Without dead ends: 13954 [2022-11-03 03:37:30,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:37:30,677 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 32 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:30,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 84 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-03 03:37:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13954 states. [2022-11-03 03:37:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13954 to 13954. [2022-11-03 03:37:30,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13954 states, 13949 states have (on average 3.966305828374794) internal successors, (55326), 13953 states have internal predecessors, (55326), 0 states have call successors, (0), 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-03 03:37:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13954 states to 13954 states and 55326 transitions. [2022-11-03 03:37:31,031 INFO L78 Accepts]: Start accepts. Automaton has 13954 states and 55326 transitions. Word has length 28 [2022-11-03 03:37:31,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:31,031 INFO L495 AbstractCegarLoop]: Abstraction has 13954 states and 55326 transitions. [2022-11-03 03:37:31,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-03 03:37:31,032 INFO L276 IsEmpty]: Start isEmpty. Operand 13954 states and 55326 transitions. [2022-11-03 03:37:31,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:37:31,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:31,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:31,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 03:37:31,038 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:31,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1278116038, now seen corresponding path program 4 times [2022-11-03 03:37:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:31,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031482666] [2022-11-03 03:37:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:37:33,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:33,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031482666] [2022-11-03 03:37:33,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031482666] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:33,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046266715] [2022-11-03 03:37:33,799 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:37:33,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:33,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:33,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:33,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:37:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:34,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-03 03:37:34,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:34,340 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:37:34,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:37:34,561 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:37:34,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:37:34,748 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:37:34,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:37:35,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:37:35,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 03:37:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 17 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 75 [2022-11-03 03:37:35,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2022-11-03 03:37:35,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:35,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:35,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 90 [2022-11-03 03:37:36,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:37:36,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:36,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 88 treesize of output 105 [2022-11-03 03:37:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 03:37:36,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:37:36,312 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0)))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2938 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_2938) c_~C~0.base v_ArrVal_2942) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2938 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_2938) c_~C~0.base v_ArrVal_2942) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)))) is different from false [2022-11-03 03:37:36,365 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse2 1))) (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse1 0) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))))) (and (forall ((v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2938 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_2938) c_~C~0.base v_ArrVal_2942) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2938 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_2938) c_~C~0.base v_ArrVal_2942) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)))))) is different from false [2022-11-03 03:37:36,500 INFO L356 Elim1Store]: treesize reduction 372, result has 17.1 percent of original size [2022-11-03 03:37:36,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 95 [2022-11-03 03:37:36,532 INFO L356 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-11-03 03:37:36,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 148 treesize of output 87 [2022-11-03 03:37:36,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-11-03 03:37:36,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-03 03:37:36,622 INFO L356 Elim1Store]: treesize reduction 448, result has 0.2 percent of original size [2022-11-03 03:37:36,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 1 [2022-11-03 03:37:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2022-11-03 03:37:37,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046266715] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:37:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335421616] [2022-11-03 03:37:37,028 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-03 03:37:37,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:37:37,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 30 [2022-11-03 03:37:37,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609687600] [2022-11-03 03:37:37,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:37:37,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 03:37:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:37:37,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 03:37:37,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=750, Unknown=2, NotChecked=114, Total=992 [2022-11-03 03:37:37,030 INFO L87 Difference]: Start difference. First operand 13954 states and 55326 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-03 03:37:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:37:51,424 INFO L93 Difference]: Finished difference Result 24399 states and 96178 transitions. [2022-11-03 03:37:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-03 03:37:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-03 03:37:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:37:51,558 INFO L225 Difference]: With dead ends: 24399 [2022-11-03 03:37:51,559 INFO L226 Difference]: Without dead ends: 24038 [2022-11-03 03:37:51,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=564, Invalid=3087, Unknown=17, NotChecked=238, Total=3906 [2022-11-03 03:37:51,561 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 743 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 2731 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 4505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1564 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:37:51,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1115 Invalid, 4505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2731 Invalid, 0 Unknown, 1564 Unchecked, 10.1s Time] [2022-11-03 03:37:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24038 states. [2022-11-03 03:37:52,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24038 to 15224. [2022-11-03 03:37:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15224 states, 15219 states have (on average 3.9887640449438204) internal successors, (60705), 15223 states have internal predecessors, (60705), 0 states have call successors, (0), 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-03 03:37:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15224 states to 15224 states and 60705 transitions. [2022-11-03 03:37:52,146 INFO L78 Accepts]: Start accepts. Automaton has 15224 states and 60705 transitions. Word has length 29 [2022-11-03 03:37:52,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:37:52,147 INFO L495 AbstractCegarLoop]: Abstraction has 15224 states and 60705 transitions. [2022-11-03 03:37:52,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 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-03 03:37:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15224 states and 60705 transitions. [2022-11-03 03:37:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:37:52,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:37:52,157 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:37:52,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:37:52,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:37:52,358 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:37:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:37:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1263009118, now seen corresponding path program 5 times [2022-11-03 03:37:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:37:52,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087053534] [2022-11-03 03:37:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:37:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:37:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:37:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:37:55,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:37:55,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087053534] [2022-11-03 03:37:55,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087053534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:37:55,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15443372] [2022-11-03 03:37:55,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:37:55,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:37:55,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:37:55,090 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:37:55,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:37:55,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 03:37:55,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:37:55,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-03 03:37:55,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:37:56,103 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:37:56,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:37:56,195 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:37:56,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:37:56,276 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 03:37:56,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 03:37:56,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:37:56,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 03:37:56,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:37:56,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 03:37:57,109 INFO L356 Elim1Store]: treesize reduction 527, result has 6.4 percent of original size [2022-11-03 03:37:57,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 101 [2022-11-03 03:37:57,296 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 03:37:57,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 88 [2022-11-03 03:38:01,435 INFO L356 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-03 03:38:01,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-03 03:38:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:38:03,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:38:03,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15443372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:03,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:38:03,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 19 [2022-11-03 03:38:03,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382740900] [2022-11-03 03:38:03,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:03,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:38:03,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:38:03,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=330, Unknown=1, NotChecked=0, Total=420 [2022-11-03 03:38:03,568 INFO L87 Difference]: Start difference. First operand 15224 states and 60705 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:14,103 INFO L93 Difference]: Finished difference Result 23405 states and 93671 transitions. [2022-11-03 03:38:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:38:14,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 03:38:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:14,352 INFO L225 Difference]: With dead ends: 23405 [2022-11-03 03:38:14,352 INFO L226 Difference]: Without dead ends: 23405 [2022-11-03 03:38:14,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=265, Invalid=724, Unknown=3, NotChecked=0, Total=992 [2022-11-03 03:38:14,353 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 445 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:14,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 208 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 647 Invalid, 0 Unknown, 298 Unchecked, 1.9s Time] [2022-11-03 03:38:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23405 states. [2022-11-03 03:38:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23405 to 15372. [2022-11-03 03:38:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15372 states, 15367 states have (on average 3.9985032862627707) internal successors, (61445), 15371 states have internal predecessors, (61445), 0 states have call successors, (0), 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-03 03:38:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15372 states to 15372 states and 61445 transitions. [2022-11-03 03:38:14,919 INFO L78 Accepts]: Start accepts. Automaton has 15372 states and 61445 transitions. Word has length 29 [2022-11-03 03:38:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:14,920 INFO L495 AbstractCegarLoop]: Abstraction has 15372 states and 61445 transitions. [2022-11-03 03:38:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15372 states and 61445 transitions. [2022-11-03 03:38:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:38:14,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:14,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:14,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:15,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:38:15,147 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:38:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:15,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1262522728, now seen corresponding path program 6 times [2022-11-03 03:38:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:15,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804504189] [2022-11-03 03:38:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:38:17,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804504189] [2022-11-03 03:38:17,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804504189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572971141] [2022-11-03 03:38:17,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:38:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:17,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:17,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:38:17,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:38:17,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:38:17,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-03 03:38:18,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:18,096 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:38:18,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:38:18,151 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:38:18,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:38:18,256 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:38:18,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:38:18,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:38:18,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 03:38:18,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:18,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 03:38:19,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:38:19,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 03:38:19,387 INFO L356 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-03 03:38:19,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 116 [2022-11-03 03:38:19,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 94 [2022-11-03 03:38:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:38:23,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:38:23,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572971141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:23,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:38:23,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2022-11-03 03:38:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241102585] [2022-11-03 03:38:23,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:23,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:38:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:38:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=472, Unknown=1, NotChecked=0, Total=600 [2022-11-03 03:38:23,560 INFO L87 Difference]: Start difference. First operand 15372 states and 61445 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:32,262 INFO L93 Difference]: Finished difference Result 21892 states and 87467 transitions. [2022-11-03 03:38:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:38:32,263 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 03:38:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:32,331 INFO L225 Difference]: With dead ends: 21892 [2022-11-03 03:38:32,331 INFO L226 Difference]: Without dead ends: 21744 [2022-11-03 03:38:32,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=325, Invalid=862, Unknown=3, NotChecked=0, Total=1190 [2022-11-03 03:38:32,332 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 439 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:32,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 173 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 678 Invalid, 0 Unknown, 227 Unchecked, 2.0s Time] [2022-11-03 03:38:32,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21744 states. [2022-11-03 03:38:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21744 to 13066. [2022-11-03 03:38:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13066 states, 13061 states have (on average 3.930020672230304) internal successors, (51330), 13065 states have internal predecessors, (51330), 0 states have call successors, (0), 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-03 03:38:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13066 states to 13066 states and 51330 transitions. [2022-11-03 03:38:32,862 INFO L78 Accepts]: Start accepts. Automaton has 13066 states and 51330 transitions. Word has length 29 [2022-11-03 03:38:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:32,863 INFO L495 AbstractCegarLoop]: Abstraction has 13066 states and 51330 transitions. [2022-11-03 03:38:32,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:38:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 13066 states and 51330 transitions. [2022-11-03 03:38:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:38:32,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:32,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:32,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:33,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:38:33,087 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:38:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2093703824, now seen corresponding path program 1 times [2022-11-03 03:38:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:33,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690401452] [2022-11-03 03:38:33,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:33,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:38:34,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:34,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690401452] [2022-11-03 03:38:34,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690401452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:34,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:38:34,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:38:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445393842] [2022-11-03 03:38:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:34,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:38:34,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:38:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:38:34,518 INFO L87 Difference]: Start difference. First operand 13066 states and 51330 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-03 03:38:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:36,267 INFO L93 Difference]: Finished difference Result 23643 states and 93237 transitions. [2022-11-03 03:38:36,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:38:36,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2022-11-03 03:38:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:36,342 INFO L225 Difference]: With dead ends: 23643 [2022-11-03 03:38:36,342 INFO L226 Difference]: Without dead ends: 22755 [2022-11-03 03:38:36,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-03 03:38:36,343 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 352 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:36,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 105 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 03:38:36,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22755 states. [2022-11-03 03:38:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22755 to 16840. [2022-11-03 03:38:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16840 states, 16835 states have (on average 3.9171369171369173) internal successors, (65945), 16839 states have internal predecessors, (65945), 0 states have call successors, (0), 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-03 03:38:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16840 states to 16840 states and 65945 transitions. [2022-11-03 03:38:36,867 INFO L78 Accepts]: Start accepts. Automaton has 16840 states and 65945 transitions. Word has length 30 [2022-11-03 03:38:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:36,867 INFO L495 AbstractCegarLoop]: Abstraction has 16840 states and 65945 transitions. [2022-11-03 03:38:36,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-03 03:38:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 16840 states and 65945 transitions. [2022-11-03 03:38:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 03:38:36,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:36,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:36,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 03:38:36,875 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:38:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash -877358384, now seen corresponding path program 2 times [2022-11-03 03:38:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615979735] [2022-11-03 03:38:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:38:38,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:38,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615979735] [2022-11-03 03:38:38,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615979735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:38:38,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:38:38,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 03:38:38,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453378264] [2022-11-03 03:38:38,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:38,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:38:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:38:38,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:38:38,481 INFO L87 Difference]: Start difference. First operand 16840 states and 65945 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-03 03:38:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:40,478 INFO L93 Difference]: Finished difference Result 25716 states and 100676 transitions. [2022-11-03 03:38:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:38:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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 30 [2022-11-03 03:38:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:40,556 INFO L225 Difference]: With dead ends: 25716 [2022-11-03 03:38:40,556 INFO L226 Difference]: Without dead ends: 24384 [2022-11-03 03:38:40,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:38:40,557 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 427 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:40,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 106 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 03:38:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24384 states. [2022-11-03 03:38:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24384 to 14533. [2022-11-03 03:38:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14533 states, 14529 states have (on average 3.9414274898478903) internal successors, (57265), 14532 states have internal predecessors, (57265), 0 states have call successors, (0), 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-03 03:38:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 57265 transitions. [2022-11-03 03:38:41,131 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 57265 transitions. Word has length 30 [2022-11-03 03:38:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:41,131 INFO L495 AbstractCegarLoop]: Abstraction has 14533 states and 57265 transitions. [2022-11-03 03:38:41,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 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-03 03:38:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 57265 transitions. [2022-11-03 03:38:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:38:41,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:41,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:41,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 03:38:41,143 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:38:41,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1334922160, now seen corresponding path program 1 times [2022-11-03 03:38:41,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:41,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959461210] [2022-11-03 03:38:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:41,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:38:41,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:41,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959461210] [2022-11-03 03:38:41,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959461210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:41,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349761052] [2022-11-03 03:38:41,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:41,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:41,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:41,383 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:41,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:38:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:41,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 03:38:41,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:38:41,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:38:42,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349761052] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:42,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:38:42,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2022-11-03 03:38:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880850372] [2022-11-03 03:38:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:38:42,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:38:42,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:42,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:38:42,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:38:42,097 INFO L87 Difference]: Start difference. First operand 14533 states and 57265 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-03 03:38:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:38:42,558 INFO L93 Difference]: Finished difference Result 14533 states and 56965 transitions. [2022-11-03 03:38:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:38:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 34 [2022-11-03 03:38:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:38:42,604 INFO L225 Difference]: With dead ends: 14533 [2022-11-03 03:38:42,604 INFO L226 Difference]: Without dead ends: 14533 [2022-11-03 03:38:42,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:38:42,605 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:38:42,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 40 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:38:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14533 states. [2022-11-03 03:38:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14533 to 14533. [2022-11-03 03:38:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14533 states, 14529 states have (on average 3.9207791313923877) internal successors, (56965), 14532 states have internal predecessors, (56965), 0 states have call successors, (0), 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-03 03:38:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 56965 transitions. [2022-11-03 03:38:43,080 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 56965 transitions. Word has length 34 [2022-11-03 03:38:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:38:43,081 INFO L495 AbstractCegarLoop]: Abstraction has 14533 states and 56965 transitions. [2022-11-03 03:38:43,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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-03 03:38:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 56965 transitions. [2022-11-03 03:38:43,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 03:38:43,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:38:43,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:38:43,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:38:43,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:43,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:38:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:38:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1408299156, now seen corresponding path program 3 times [2022-11-03 03:38:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:38:43,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677494878] [2022-11-03 03:38:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:38:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:38:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:38:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:38:45,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:38:45,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677494878] [2022-11-03 03:38:45,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677494878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:38:45,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35225766] [2022-11-03 03:38:45,581 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:38:45,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:38:45,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:38:45,582 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:38:45,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:38:46,136 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:38:46,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:38:46,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-03 03:38:46,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:38:46,250 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:38:46,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:38:46,349 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:38:46,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:38:46,610 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:38:46,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:38:47,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:38:47,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 03:38:47,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 03:38:47,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:47,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 30 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 115 [2022-11-03 03:38:47,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2022-11-03 03:38:48,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:38:48,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 35 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 145 [2022-11-03 03:38:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 03:38:48,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:38:48,473 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0)))) (store .cse2 c_~B~0.base (store (store (store (store (select .cse2 c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ .cse3 2 c_~B~0.offset) 0) (+ .cse3 3 c_~B~0.offset) 0))))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_5287 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5287) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_5287 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5287) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_5287 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5287) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)))) is different from false [2022-11-03 03:38:49,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ .cse1 c_~B~0.offset 1))) (let ((.cse0 (let ((.cse4 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse3 (let ((.cse5 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse2 0) (+ 2 .cse1 c_~B~0.offset) 0)))) (store .cse5 c_~A~0.base (store (store (store (store (select .cse5 c_~A~0.base) (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))))) (store .cse3 c_~B~0.base (store (store (store (store (select .cse3 c_~B~0.base) (+ .cse4 c_~B~0.offset) 0) (+ .cse4 c_~B~0.offset 1) 0) (+ .cse4 2 c_~B~0.offset) 0) (+ .cse4 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_5287 (Array Int Int))) (= 0 (select (select (store .cse0 c_~C~0.base v_ArrVal_5287) c_~B~0.base) (+ .cse1 c_~B~0.offset)))) (forall ((v_ArrVal_5287 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_5287) c_~B~0.base) .cse2) 0)))))) is different from false [2022-11-03 03:38:50,692 INFO L356 Elim1Store]: treesize reduction 2652, result has 5.0 percent of original size [2022-11-03 03:38:50,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 235 treesize of output 156 [2022-11-03 03:38:50,781 INFO L356 Elim1Store]: treesize reduction 599, result has 0.2 percent of original size [2022-11-03 03:38:50,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 172 treesize of output 67 [2022-11-03 03:38:50,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-11-03 03:38:51,141 INFO L356 Elim1Store]: treesize reduction 2792, result has 0.0 percent of original size [2022-11-03 03:38:51,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 11 case distinctions, treesize of input 234 treesize of output 1 [2022-11-03 03:38:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 1 not checked. [2022-11-03 03:38:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35225766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:38:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650548074] [2022-11-03 03:38:51,500 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-03 03:38:51,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:38:51,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 33 [2022-11-03 03:38:51,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711291018] [2022-11-03 03:38:51,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:38:51,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 03:38:51,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:38:51,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 03:38:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=830, Unknown=6, NotChecked=122, Total=1122 [2022-11-03 03:38:51,502 INFO L87 Difference]: Start difference. First operand 14533 states and 56965 transitions. Second operand has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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-03 03:39:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:39:06,204 INFO L93 Difference]: Finished difference Result 21644 states and 85695 transitions. [2022-11-03 03:39:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-03 03:39:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-03 03:39:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:39:06,365 INFO L225 Difference]: With dead ends: 21644 [2022-11-03 03:39:06,365 INFO L226 Difference]: Without dead ends: 21375 [2022-11-03 03:39:06,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=548, Invalid=2209, Unknown=7, NotChecked=206, Total=2970 [2022-11-03 03:39:06,367 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 543 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 4315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2025 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:39:06,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 865 Invalid, 4315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2168 Invalid, 0 Unknown, 2025 Unchecked, 8.4s Time] [2022-11-03 03:39:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21375 states. [2022-11-03 03:39:06,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21375 to 16292. [2022-11-03 03:39:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16292 states, 16288 states have (on average 3.9351669941060905) internal successors, (64096), 16291 states have internal predecessors, (64096), 0 states have call successors, (0), 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-03 03:39:06,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16292 states to 16292 states and 64096 transitions. [2022-11-03 03:39:06,880 INFO L78 Accepts]: Start accepts. Automaton has 16292 states and 64096 transitions. Word has length 35 [2022-11-03 03:39:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:39:06,881 INFO L495 AbstractCegarLoop]: Abstraction has 16292 states and 64096 transitions. [2022-11-03 03:39:06,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 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-03 03:39:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16292 states and 64096 transitions. [2022-11-03 03:39:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 03:39:06,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:39:06,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:39:06,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:07,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:07,102 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:39:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:39:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1408759506, now seen corresponding path program 4 times [2022-11-03 03:39:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:39:07,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061321695] [2022-11-03 03:39:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:39:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:39:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:39:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:39:10,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:39:10,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061321695] [2022-11-03 03:39:10,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061321695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:39:10,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164132629] [2022-11-03 03:39:10,026 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:39:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:39:10,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:39:10,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:39:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:39:10,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-03 03:39:10,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:39:10,750 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:39:10,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:39:10,802 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:39:10,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:39:10,919 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:39:10,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:39:11,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:39:11,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 03:39:11,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:11,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 03:39:12,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:39:12,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 03:39:12,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 152 [2022-11-03 03:39:12,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 614 treesize of output 219 [2022-11-03 03:39:12,526 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:39:12,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:39:12,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164132629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:39:12,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:39:12,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2022-11-03 03:39:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130516131] [2022-11-03 03:39:12,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:39:12,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:39:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:39:12,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:39:12,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=468, Unknown=4, NotChecked=0, Total=600 [2022-11-03 03:39:12,528 INFO L87 Difference]: Start difference. First operand 16292 states and 64096 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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-03 03:39:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:39:15,195 INFO L93 Difference]: Finished difference Result 21360 states and 84850 transitions. [2022-11-03 03:39:15,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:39:15,196 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-03 03:39:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:39:15,277 INFO L225 Difference]: With dead ends: 21360 [2022-11-03 03:39:15,277 INFO L226 Difference]: Without dead ends: 21185 [2022-11-03 03:39:15,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=326, Invalid=858, Unknown=6, NotChecked=0, Total=1190 [2022-11-03 03:39:15,278 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 362 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:39:15,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 158 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 560 Invalid, 0 Unknown, 141 Unchecked, 1.8s Time] [2022-11-03 03:39:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21185 states. [2022-11-03 03:39:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21185 to 13497. [2022-11-03 03:39:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13497 states, 13493 states have (on average 3.909212184095457) internal successors, (52747), 13496 states have internal predecessors, (52747), 0 states have call successors, (0), 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-03 03:39:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 52747 transitions. [2022-11-03 03:39:15,867 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 52747 transitions. Word has length 35 [2022-11-03 03:39:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:39:15,868 INFO L495 AbstractCegarLoop]: Abstraction has 13497 states and 52747 transitions. [2022-11-03 03:39:15,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 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-03 03:39:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 52747 transitions. [2022-11-03 03:39:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 03:39:15,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:39:15,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:39:15,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:16,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:16,083 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:39:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:39:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1371525558, now seen corresponding path program 1 times [2022-11-03 03:39:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:39:16,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454267046] [2022-11-03 03:39:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:39:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:39:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:39:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:39:16,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:39:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454267046] [2022-11-03 03:39:16,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454267046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:39:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686115727] [2022-11-03 03:39:16,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:39:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:16,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:39:16,424 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:39:16,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:39:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:39:17,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:39:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:39:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:39:17,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:39:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 03:39:17,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686115727] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:39:17,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1664178177] [2022-11-03 03:39:17,581 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-03 03:39:17,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:39:17,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-03 03:39:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842842434] [2022-11-03 03:39:17,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:39:17,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:39:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:39:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:39:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:39:17,590 INFO L87 Difference]: Start difference. First operand 13497 states and 52747 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 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-03 03:39:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:39:19,734 INFO L93 Difference]: Finished difference Result 13936 states and 53324 transitions. [2022-11-03 03:39:19,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:39:19,747 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 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 37 [2022-11-03 03:39:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:39:19,788 INFO L225 Difference]: With dead ends: 13936 [2022-11-03 03:39:19,788 INFO L226 Difference]: Without dead ends: 13936 [2022-11-03 03:39:19,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:39:19,789 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 735 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:39:19,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 250 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-03 03:39:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13936 states. [2022-11-03 03:39:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13936 to 10466. [2022-11-03 03:39:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10466 states, 10462 states have (on average 3.8959090040145288) internal successors, (40759), 10465 states have internal predecessors, (40759), 0 states have call successors, (0), 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-03 03:39:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 40759 transitions. [2022-11-03 03:39:20,076 INFO L78 Accepts]: Start accepts. Automaton has 10466 states and 40759 transitions. Word has length 37 [2022-11-03 03:39:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:39:20,076 INFO L495 AbstractCegarLoop]: Abstraction has 10466 states and 40759 transitions. [2022-11-03 03:39:20,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 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-03 03:39:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 10466 states and 40759 transitions. [2022-11-03 03:39:20,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:39:20,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:39:20,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:39:20,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:39:20,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:20,301 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:39:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:39:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 120329403, now seen corresponding path program 2 times [2022-11-03 03:39:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:39:20,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119416883] [2022-11-03 03:39:20,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:39:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:39:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:39:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:39:22,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:39:22,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119416883] [2022-11-03 03:39:22,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119416883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:39:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594471098] [2022-11-03 03:39:22,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:39:22,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:39:22,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:39:22,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:39:22,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:39:23,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 03:39:23,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:39:23,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 03:39:23,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:39:23,285 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:39:23,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:39:23,339 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:39:23,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:39:23,451 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:39:23,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:39:23,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:39:23,914 INFO L356 Elim1Store]: treesize reduction 176, result has 5.9 percent of original size [2022-11-03 03:39:23,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 71 [2022-11-03 03:39:23,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-03 03:39:28,125 INFO L356 Elim1Store]: treesize reduction 181, result has 21.0 percent of original size [2022-11-03 03:39:28,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 75 treesize of output 86 [2022-11-03 03:39:34,321 INFO L356 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-03 03:39:34,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-03 03:39:38,537 INFO L356 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-03 03:39:38,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-03 03:39:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 03:39:38,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:39:38,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6690 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6691 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse0 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0) 0) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset 3 .cse0) 0))) c_~B~0.base v_ArrVal_6691) c_~C~0.base v_ArrVal_6690) c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) 0)) is different from false [2022-11-03 03:39:38,786 INFO L356 Elim1Store]: treesize reduction 185, result has 25.7 percent of original size [2022-11-03 03:39:38,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 81 [2022-11-03 03:39:38,798 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-11-03 03:39:38,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 80 [2022-11-03 03:39:38,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-11-03 03:39:38,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-11-03 03:39:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 03:39:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594471098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:39:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1616765916] [2022-11-03 03:39:39,232 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-03 03:39:39,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:39:39,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 22 [2022-11-03 03:39:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671167523] [2022-11-03 03:39:39,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:39:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 03:39:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:39:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 03:39:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=421, Unknown=6, NotChecked=42, Total=552 [2022-11-03 03:39:39,234 INFO L87 Difference]: Start difference. First operand 10466 states and 40759 transitions. Second operand has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 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-03 03:39:41,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_6690 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6691 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~B~0.base v_ArrVal_6691) c_~C~0.base v_ArrVal_6690) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1))) is different from false [2022-11-03 03:39:54,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_6690 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6691 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~B~0.base v_ArrVal_6691) c_~C~0.base v_ArrVal_6690) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (= c_thread1Thread1of1ForFork2_~i~0 1) (= |c_thread2Thread1of1ForFork0_~i~1#1| 1))) is different from false [2022-11-03 03:39:56,034 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_6690 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6691 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~B~0.base v_ArrVal_6691) c_~C~0.base v_ArrVal_6690) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= (select |c_#valid| c_~A~0.base) 1) (= |c_thread2Thread1of1ForFork0_~i~1#1| 1))) is different from false [2022-11-03 03:40:57,677 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_6690 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6691 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~B~0.base v_ArrVal_6691) c_~C~0.base v_ArrVal_6690) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)))) is different from false [2022-11-03 03:41:00,356 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (not (= |c_thread2Thread1of1ForFork0_~i~1#1| c_thread1Thread1of1ForFork2_~i~0)) (forall ((v_ArrVal_6690 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6691 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~B~0.base v_ArrVal_6691) c_~C~0.base v_ArrVal_6690) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= |c_thread2Thread1of1ForFork0_~i~1#1| 1))) is different from false [2022-11-03 03:41:02,365 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_6690 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int) (v_ArrVal_6691 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* |thread2Thread1of1ForFork0_~i~1#1| 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0))) c_~B~0.base v_ArrVal_6691) c_~C~0.base v_ArrVal_6690) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (= |c_thread2Thread1of1ForFork0_~i~1#1| 1))) is different from false [2022-11-03 03:41:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:02,838 INFO L93 Difference]: Finished difference Result 45586 states and 180866 transitions. [2022-11-03 03:41:02,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-03 03:41:02,839 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 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 40 [2022-11-03 03:41:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:03,026 INFO L225 Difference]: With dead ends: 45586 [2022-11-03 03:41:03,026 INFO L226 Difference]: Without dead ends: 45586 [2022-11-03 03:41:03,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 91.9s TimeCoverageRelationStatistics Valid=397, Invalid=1659, Unknown=42, NotChecked=658, Total=2756 [2022-11-03 03:41:03,027 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 521 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 4189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2097 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:03,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 728 Invalid, 4189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1974 Invalid, 0 Unknown, 2097 Unchecked, 6.0s Time] [2022-11-03 03:41:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45586 states. [2022-11-03 03:41:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45586 to 16679. [2022-11-03 03:41:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16679 states, 16675 states have (on average 4.036581709145428) internal successors, (67310), 16678 states have internal predecessors, (67310), 0 states have call successors, (0), 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-03 03:41:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16679 states to 16679 states and 67310 transitions. [2022-11-03 03:41:04,105 INFO L78 Accepts]: Start accepts. Automaton has 16679 states and 67310 transitions. Word has length 40 [2022-11-03 03:41:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:04,106 INFO L495 AbstractCegarLoop]: Abstraction has 16679 states and 67310 transitions. [2022-11-03 03:41:04,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 23 states have internal predecessors, (86), 0 states have call successors, (0), 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-03 03:41:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 16679 states and 67310 transitions. [2022-11-03 03:41:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:41:04,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:04,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:04,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-03 03:41:04,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 03:41:04,330 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:41:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:04,331 INFO L85 PathProgramCache]: Analyzing trace with hash -348878847, now seen corresponding path program 3 times [2022-11-03 03:41:04,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:04,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244583481] [2022-11-03 03:41:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:41:05,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:05,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244583481] [2022-11-03 03:41:05,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244583481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:05,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783331261] [2022-11-03 03:41:05,982 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:41:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:05,983 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:05,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:41:06,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:41:06,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:41:06,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-03 03:41:06,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:06,822 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:41:06,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:41:06,964 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:41:06,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:41:07,098 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:41:07,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:41:07,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:41:07,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 03:41:08,043 INFO L356 Elim1Store]: treesize reduction 250, result has 8.8 percent of original size [2022-11-03 03:41:08,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 75 [2022-11-03 03:41:08,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2022-11-03 03:41:08,191 INFO L356 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-11-03 03:41:08,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 54 [2022-11-03 03:41:08,336 INFO L356 Elim1Store]: treesize reduction 53, result has 14.5 percent of original size [2022-11-03 03:41:08,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 69 [2022-11-03 03:41:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 03:41:08,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:08,502 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse5) 0)) (.cse1 (+ c_~A~0.offset .cse5 1)) (.cse2 (+ c_~A~0.offset .cse5 2)) (.cse3 (+ c_~A~0.offset .cse5 3)) (.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_7150 (Array Int Int)) (v_ArrVal_7152 (Array Int Int)) (v_ArrVal_7157 Int) (v_ArrVal_7156 Int) (v_ArrVal_7155 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (store (store (store .cse0 .cse1 v_ArrVal_7157) .cse2 v_ArrVal_7156) .cse3 v_ArrVal_7155)) c_~B~0.base v_ArrVal_7152) c_~C~0.base v_ArrVal_7150) c_~A~0.base) (+ c_~A~0.offset .cse4 1)) 0)) (forall ((v_ArrVal_7150 (Array Int Int)) (v_ArrVal_7152 (Array Int Int)) (v_ArrVal_7157 Int) (v_ArrVal_7156 Int) (v_ArrVal_7155 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (store (store (store .cse0 .cse1 v_ArrVal_7157) .cse2 v_ArrVal_7156) .cse3 v_ArrVal_7155)) c_~B~0.base v_ArrVal_7152) c_~C~0.base v_ArrVal_7150) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0))))) is different from false [2022-11-03 03:41:08,527 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse4 1)) (.cse6 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse0 (store (store (select |c_#race| c_~A~0.base) .cse5 0) (+ c_~A~0.offset .cse6) 0)) (.cse1 (+ c_~A~0.offset .cse6 1)) (.cse2 (+ c_~A~0.offset .cse6 2)) (.cse3 (+ c_~A~0.offset .cse6 3))) (and (forall ((v_ArrVal_7150 (Array Int Int)) (v_ArrVal_7152 (Array Int Int)) (v_ArrVal_7157 Int) (v_ArrVal_7156 Int) (v_ArrVal_7155 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (store (store (store .cse0 .cse1 v_ArrVal_7157) .cse2 v_ArrVal_7156) .cse3 v_ArrVal_7155)) c_~B~0.base v_ArrVal_7152) c_~C~0.base v_ArrVal_7150) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)) (forall ((v_ArrVal_7150 (Array Int Int)) (v_ArrVal_7152 (Array Int Int)) (v_ArrVal_7157 Int) (v_ArrVal_7156 Int) (v_ArrVal_7155 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (store (store (store .cse0 .cse1 v_ArrVal_7157) .cse2 v_ArrVal_7156) .cse3 v_ArrVal_7155)) c_~B~0.base v_ArrVal_7152) c_~C~0.base v_ArrVal_7150) c_~A~0.base) .cse5) 0)))))) is different from false [2022-11-03 03:41:08,709 INFO L356 Elim1Store]: treesize reduction 363, result has 19.2 percent of original size [2022-11-03 03:41:08,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 103 [2022-11-03 03:41:08,724 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-03 03:41:08,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 151 [2022-11-03 03:41:08,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2022-11-03 03:41:08,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 78 [2022-11-03 03:41:08,944 INFO L356 Elim1Store]: treesize reduction 389, result has 13.4 percent of original size [2022-11-03 03:41:08,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 78 [2022-11-03 03:41:08,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:41:08,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 03:41:08,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:41:08,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 8 [2022-11-03 03:41:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-11-03 03:41:09,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783331261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:09,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [998630898] [2022-11-03 03:41:09,659 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-03 03:41:09,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:09,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 31 [2022-11-03 03:41:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963687130] [2022-11-03 03:41:09,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:09,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 03:41:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:09,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 03:41:09,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=795, Unknown=2, NotChecked=118, Total=1056 [2022-11-03 03:41:09,663 INFO L87 Difference]: Start difference. First operand 16679 states and 67310 transitions. Second operand has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:41:27,668 INFO L93 Difference]: Finished difference Result 74339 states and 304940 transitions. [2022-11-03 03:41:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-03 03:41:27,675 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-03 03:41:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:41:28,020 INFO L225 Difference]: With dead ends: 74339 [2022-11-03 03:41:28,020 INFO L226 Difference]: Without dead ends: 73303 [2022-11-03 03:41:28,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1351, Invalid=5602, Unknown=27, NotChecked=330, Total=7310 [2022-11-03 03:41:28,022 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 723 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 3480 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 5537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 3480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1658 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:41:28,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 804 Invalid, 5537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 3480 Invalid, 0 Unknown, 1658 Unchecked, 12.1s Time] [2022-11-03 03:41:28,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73303 states. [2022-11-03 03:41:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73303 to 46915. [2022-11-03 03:41:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46915 states, 46912 states have (on average 4.125255798090041) internal successors, (193524), 46914 states have internal predecessors, (193524), 0 states have call successors, (0), 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-03 03:41:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46915 states to 46915 states and 193524 transitions. [2022-11-03 03:41:30,050 INFO L78 Accepts]: Start accepts. Automaton has 46915 states and 193524 transitions. Word has length 40 [2022-11-03 03:41:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:41:30,050 INFO L495 AbstractCegarLoop]: Abstraction has 46915 states and 193524 transitions. [2022-11-03 03:41:30,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:41:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 46915 states and 193524 transitions. [2022-11-03 03:41:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-03 03:41:30,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:41:30,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:41:30,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:41:30,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:30,293 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:41:30,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:41:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash -995624685, now seen corresponding path program 4 times [2022-11-03 03:41:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:41:30,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853426924] [2022-11-03 03:41:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:41:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:41:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:41:31,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:41:31,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853426924] [2022-11-03 03:41:31,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853426924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:41:31,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653634507] [2022-11-03 03:41:31,994 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:41:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:41:31,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:41:31,996 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:41:31,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 03:41:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:41:32,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 03:41:32,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:41:32,664 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:41:32,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 03:41:32,726 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:41:32,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 03:41:32,849 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:41:32,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 03:41:33,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 03:41:33,620 INFO L356 Elim1Store]: treesize reduction 176, result has 5.9 percent of original size [2022-11-03 03:41:33,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 71 [2022-11-03 03:41:33,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-03 03:41:33,845 INFO L356 Elim1Store]: treesize reduction 181, result has 21.0 percent of original size [2022-11-03 03:41:33,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 75 treesize of output 86 [2022-11-03 03:41:36,078 INFO L356 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-03 03:41:36,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-03 03:41:38,325 INFO L356 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-03 03:41:38,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-03 03:41:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 03:41:40,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:41:40,890 INFO L356 Elim1Store]: treesize reduction 185, result has 25.7 percent of original size [2022-11-03 03:41:40,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 81 [2022-11-03 03:41:40,903 INFO L356 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-11-03 03:41:40,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 80 [2022-11-03 03:41:40,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-03 03:41:40,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2022-11-03 03:41:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 03:41:41,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653634507] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:41:41,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732923796] [2022-11-03 03:41:41,465 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-03 03:41:41,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:41:41,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 26 [2022-11-03 03:41:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558971098] [2022-11-03 03:41:41,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:41:41,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 03:41:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:41:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 03:41:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=632, Unknown=13, NotChecked=0, Total=756 [2022-11-03 03:41:41,467 INFO L87 Difference]: Start difference. First operand 46915 states and 193524 transitions. Second operand has 28 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 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-03 03:42:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:01,061 INFO L93 Difference]: Finished difference Result 98193 states and 407462 transitions. [2022-11-03 03:42:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-03 03:42:01,062 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 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 40 [2022-11-03 03:42:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:01,648 INFO L225 Difference]: With dead ends: 98193 [2022-11-03 03:42:01,648 INFO L226 Difference]: Without dead ends: 98193 [2022-11-03 03:42:01,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 78 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 9 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=877, Invalid=4351, Unknown=28, NotChecked=0, Total=5256 [2022-11-03 03:42:01,650 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 906 mSDsluCounter, 2898 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 6793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4092 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:01,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 911 Invalid, 6793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2376 Invalid, 0 Unknown, 4092 Unchecked, 7.7s Time] [2022-11-03 03:42:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98193 states. [2022-11-03 03:42:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98193 to 30507. [2022-11-03 03:42:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30507 states, 30504 states have (on average 4.095659585628114) internal successors, (124934), 30506 states have internal predecessors, (124934), 0 states have call successors, (0), 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-03 03:42:03,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30507 states to 30507 states and 124934 transitions. [2022-11-03 03:42:03,968 INFO L78 Accepts]: Start accepts. Automaton has 30507 states and 124934 transitions. Word has length 40 [2022-11-03 03:42:03,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:42:03,968 INFO L495 AbstractCegarLoop]: Abstraction has 30507 states and 124934 transitions. [2022-11-03 03:42:03,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 27 states have internal predecessors, (89), 0 states have call successors, (0), 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-03 03:42:03,968 INFO L276 IsEmpty]: Start isEmpty. Operand 30507 states and 124934 transitions. [2022-11-03 03:42:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-03 03:42:04,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:42:04,002 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:42:04,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-03 03:42:04,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 03:42:04,202 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 86 more)] === [2022-11-03 03:42:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:42:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash -251997453, now seen corresponding path program 1 times [2022-11-03 03:42:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:42:04,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391224918] [2022-11-03 03:42:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:42:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 03:42:04,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:42:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391224918] [2022-11-03 03:42:04,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391224918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:42:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715100941] [2022-11-03 03:42:04,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:42:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:42:04,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:42:04,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:42:04,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_889d9800-5d83-46cb-846f-c91f45d4da44/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 03:42:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:42:05,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 03:42:05,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:42:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 03:42:05,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:42:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 03:42:05,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715100941] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:42:05,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1051592138] [2022-11-03 03:42:05,817 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-03 03:42:05,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:42:05,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-03 03:42:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574953351] [2022-11-03 03:42:05,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:42:05,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 03:42:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:42:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 03:42:05,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:42:05,820 INFO L87 Difference]: Start difference. First operand 30507 states and 124934 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 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-03 03:42:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:42:07,773 INFO L93 Difference]: Finished difference Result 48319 states and 196760 transitions. [2022-11-03 03:42:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:42:07,773 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 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 42 [2022-11-03 03:42:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:42:08,307 INFO L225 Difference]: With dead ends: 48319 [2022-11-03 03:42:08,308 INFO L226 Difference]: Without dead ends: 48319 [2022-11-03 03:42:08,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-11-03 03:42:08,309 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 575 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:42:08,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 425 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]