./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-sum.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_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/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_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/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_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/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 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 --- 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:47:36,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:47:36,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:47:36,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:47:36,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:47:36,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:47:36,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:47:36,286 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:47:36,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:47:36,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:47:36,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:47:36,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:47:36,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:47:36,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:47:36,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:47:36,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:47:36,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:47:36,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:47:36,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:47:36,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:47:36,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:47:36,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:47:36,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:47:36,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:47:36,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:47:36,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:47:36,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:47:36,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:47:36,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:47:36,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:47:36,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:47:36,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:47:36,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:47:36,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:47:36,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:47:36,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:47:36,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:47:36,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:47:36,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:47:36,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:47:36,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:47:36,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 03:47:36,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:47:36,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:47:36,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:47:36,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:47:36,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:47:36,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:47:36,393 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:47:36,394 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:47:36,406 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:47:36,406 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:47:36,407 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:47:36,407 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:47:36,407 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:47:36,408 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:47:36,408 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:47:36,408 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:47:36,408 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:47:36,409 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:47:36,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:47:36,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:47:36,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:47:36,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:47:36,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:47:36,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:47:36,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:47:36,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:47:36,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:47:36,413 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 03:47:36,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:47:36,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:47:36,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:47:36,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:47:36,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:47:36,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:47:36,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:47:36,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:47:36,416 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:47:36,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:47:36,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:47:36,417 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:47:36,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:47:36,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:47:36,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:47:36,417 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_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/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_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/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 -> 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 [2022-11-03 03:47:36,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:47:36,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:47:36,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:47:36,816 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:47:36,817 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:47:36,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-03 03:47:36,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/data/da399f091/675a41b30c4146f8a863dfea70ab908c/FLAG5ae62f7ed [2022-11-03 03:47:37,450 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:47:37,451 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-03 03:47:37,469 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/data/da399f091/675a41b30c4146f8a863dfea70ab908c/FLAG5ae62f7ed [2022-11-03 03:47:37,788 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/data/da399f091/675a41b30c4146f8a863dfea70ab908c [2022-11-03 03:47:37,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:47:37,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:47:37,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:47:37,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:47:37,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:47:37,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:47:37" (1/1) ... [2022-11-03 03:47:37,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a3508cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:37, skipping insertion in model container [2022-11-03 03:47:37,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:47:37" (1/1) ... [2022-11-03 03:47:37,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:47:37,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:47:38,051 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_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-03 03:47:38,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:47:38,065 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:47:38,112 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_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-03 03:47:38,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:47:38,131 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:47:38,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38 WrapperNode [2022-11-03 03:47:38,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:47:38,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:47:38,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:47:38,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:47:38,140 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:47:38" (1/1) ... [2022-11-03 03:47:38,151 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:47:38" (1/1) ... [2022-11-03 03:47:38,191 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 214 [2022-11-03 03:47:38,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:47:38,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:47:38,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:47:38,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:47:38,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,231 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:47:38,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:47:38,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:47:38,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:47:38,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (1/1) ... [2022-11-03 03:47:38,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:47:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:47:38,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:47:38,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:47:38,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:47:38,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:47:38,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:47:38,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:47:38,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:47:38,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:47:38,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:47:38,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:47:38,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:47:38,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:47:38,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:47:38,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:47:38,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:47:38,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:47:38,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:47:38,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:47:38,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:47:38,331 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:47:38,446 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:47:38,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:47:39,258 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:47:39,466 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:47:39,466 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-03 03:47:39,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:39 BoogieIcfgContainer [2022-11-03 03:47:39,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:47:39,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:47:39,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:47:39,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:47:39,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:47:37" (1/3) ... [2022-11-03 03:47:39,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12abeb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:39, skipping insertion in model container [2022-11-03 03:47:39,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:47:38" (2/3) ... [2022-11-03 03:47:39,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12abeb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:47:39, skipping insertion in model container [2022-11-03 03:47:39,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:47:39" (3/3) ... [2022-11-03 03:47:39,485 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2022-11-03 03:47:39,494 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:47:39,505 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:47:39,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-03 03:47:39,505 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:47:39,640 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 03:47:39,695 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:47:39,713 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 352 places, 362 transitions, 748 flow [2022-11-03 03:47:39,717 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 352 places, 362 transitions, 748 flow [2022-11-03 03:47:39,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 352 places, 362 transitions, 748 flow [2022-11-03 03:47:39,918 INFO L130 PetriNetUnfolder]: 20/359 cut-off events. [2022-11-03 03:47:39,918 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 03:47:39,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 359 events. 20/359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 439 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 284. Up to 3 conditions per place. [2022-11-03 03:47:39,940 INFO L118 LiptonReduction]: Number of co-enabled transitions 9382 [2022-11-03 03:50:08,706 INFO L133 LiptonReduction]: Checked pairs total: 61450 [2022-11-03 03:50:08,706 INFO L135 LiptonReduction]: Total number of compositions: 443 [2022-11-03 03:50:08,714 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 99 transitions, 222 flow [2022-11-03 03:50:09,968 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27076 states, 25734 states have (on average 4.32983601461102) internal successors, (111424), 27075 states have internal predecessors, (111424), 0 states have call successors, (0), 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:50:10,017 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:50:10,025 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;@79b65992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:50:10,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-03 03:50:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 27076 states, 25734 states have (on average 4.32983601461102) internal successors, (111424), 27075 states have internal predecessors, (111424), 0 states have call successors, (0), 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:50:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-03 03:50:10,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:10,148 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-03 03:50:10,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1475, now seen corresponding path program 1 times [2022-11-03 03:50:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:10,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669610130] [2022-11-03 03:50:10,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:10,331 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:50:10,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:10,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669610130] [2022-11-03 03:50:10,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669610130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:10,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:10,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-03 03:50:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444115494] [2022-11-03 03:50:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:10,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 03:50:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:10,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 03:50:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 03:50:10,553 INFO L87 Difference]: Start difference. First operand has 27076 states, 25734 states have (on average 4.32983601461102) internal successors, (111424), 27075 states have internal predecessors, (111424), 0 states have call successors, (0), 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:50:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:10,889 INFO L93 Difference]: Finished difference Result 3066 states and 12103 transitions. [2022-11-03 03:50:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 03:50:10,893 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:50:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:10,964 INFO L225 Difference]: With dead ends: 3066 [2022-11-03 03:50:10,964 INFO L226 Difference]: Without dead ends: 3035 [2022-11-03 03:50:10,965 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:50:10,969 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:10,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:50:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3035 states. [2022-11-03 03:50:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3035 to 3035. [2022-11-03 03:50:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3029 states have (on average 3.966985803895675) internal successors, (12016), 3034 states have internal predecessors, (12016), 0 states have call successors, (0), 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:50:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 12016 transitions. [2022-11-03 03:50:11,354 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 12016 transitions. Word has length 1 [2022-11-03 03:50:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:11,354 INFO L495 AbstractCegarLoop]: Abstraction has 3035 states and 12016 transitions. [2022-11-03 03:50:11,354 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:50:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 12016 transitions. [2022-11-03 03:50:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 03:50:11,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:11,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:11,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:50:11,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:11,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1191811806, now seen corresponding path program 1 times [2022-11-03 03:50:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:11,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348862349] [2022-11-03 03:50:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:11,966 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:50:11,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:11,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348862349] [2022-11-03 03:50:11,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348862349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:11,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:50:11,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33011020] [2022-11-03 03:50:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:11,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:50:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:11,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:50:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:50:11,981 INFO L87 Difference]: Start difference. First operand 3035 states and 12016 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:50:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:12,508 INFO L93 Difference]: Finished difference Result 3861 states and 15025 transitions. [2022-11-03 03:50:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:50:12,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:50:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:12,543 INFO L225 Difference]: With dead ends: 3861 [2022-11-03 03:50:12,543 INFO L226 Difference]: Without dead ends: 3861 [2022-11-03 03:50:12,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:50:12,545 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 94 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:12,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:50:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2022-11-03 03:50:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3551. [2022-11-03 03:50:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3551 states, 3545 states have (on average 3.968124118476728) internal successors, (14067), 3550 states have internal predecessors, (14067), 0 states have call successors, (0), 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:50:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 14067 transitions. [2022-11-03 03:50:12,769 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 14067 transitions. Word has length 13 [2022-11-03 03:50:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:12,770 INFO L495 AbstractCegarLoop]: Abstraction has 3551 states and 14067 transitions. [2022-11-03 03:50:12,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 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:50:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 14067 transitions. [2022-11-03 03:50:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 03:50:12,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:12,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:50:12,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:50:12,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:12,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2005627237, now seen corresponding path program 1 times [2022-11-03 03:50:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:12,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450904109] [2022-11-03 03:50:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:13,398 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:50:13,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:13,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450904109] [2022-11-03 03:50:13,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450904109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:13,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:13,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:50:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441892920] [2022-11-03 03:50:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:13,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:50:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:13,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:50:13,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:50:13,401 INFO L87 Difference]: Start difference. First operand 3551 states and 14067 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:50:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:14,456 INFO L93 Difference]: Finished difference Result 5056 states and 19983 transitions. [2022-11-03 03:50:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:50:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:50:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:14,498 INFO L225 Difference]: With dead ends: 5056 [2022-11-03 03:50:14,498 INFO L226 Difference]: Without dead ends: 5056 [2022-11-03 03:50:14,498 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:50:14,499 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 80 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:14,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 72 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 03:50:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5056 states. [2022-11-03 03:50:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5056 to 4651. [2022-11-03 03:50:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4651 states, 4645 states have (on average 4.023035522066738) internal successors, (18687), 4650 states have internal predecessors, (18687), 0 states have call successors, (0), 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:50:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4651 states to 4651 states and 18687 transitions. [2022-11-03 03:50:14,753 INFO L78 Accepts]: Start accepts. Automaton has 4651 states and 18687 transitions. Word has length 15 [2022-11-03 03:50:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:14,754 INFO L495 AbstractCegarLoop]: Abstraction has 4651 states and 18687 transitions. [2022-11-03 03:50:14,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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:50:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4651 states and 18687 transitions. [2022-11-03 03:50:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:50:14,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:14,757 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:50:14,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:50:14,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash 646720100, now seen corresponding path program 1 times [2022-11-03 03:50:14,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:14,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135293128] [2022-11-03 03:50:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:15,203 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:50:15,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:15,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135293128] [2022-11-03 03:50:15,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135293128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:15,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:15,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:50:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119129407] [2022-11-03 03:50:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:15,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:50:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:50:15,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:50:15,206 INFO L87 Difference]: Start difference. First operand 4651 states and 18687 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:50:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:16,622 INFO L93 Difference]: Finished difference Result 6658 states and 26884 transitions. [2022-11-03 03:50:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:50:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:50:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:16,672 INFO L225 Difference]: With dead ends: 6658 [2022-11-03 03:50:16,672 INFO L226 Difference]: Without dead ends: 6658 [2022-11-03 03:50:16,673 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:50:16,674 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 63 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:16,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 69 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 03:50:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6658 states. [2022-11-03 03:50:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6658 to 5356. [2022-11-03 03:50:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5356 states, 5350 states have (on average 4.03196261682243) internal successors, (21571), 5355 states have internal predecessors, (21571), 0 states have call successors, (0), 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:50:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 21571 transitions. [2022-11-03 03:50:16,936 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 21571 transitions. Word has length 16 [2022-11-03 03:50:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:16,936 INFO L495 AbstractCegarLoop]: Abstraction has 5356 states and 21571 transitions. [2022-11-03 03:50:16,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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:50:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 21571 transitions. [2022-11-03 03:50:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 03:50:16,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:16,941 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:50:16,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:50:16,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:16,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2045081378, now seen corresponding path program 1 times [2022-11-03 03:50:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:16,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413020883] [2022-11-03 03:50:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:17,149 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:50:17,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:17,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413020883] [2022-11-03 03:50:17,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413020883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:17,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:17,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:50:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687622799] [2022-11-03 03:50:17,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:17,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:50:17,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:50:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:50:17,155 INFO L87 Difference]: Start difference. First operand 5356 states and 21571 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:50:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:17,686 INFO L93 Difference]: Finished difference Result 6164 states and 23841 transitions. [2022-11-03 03:50:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:50:17,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:50:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:17,722 INFO L225 Difference]: With dead ends: 6164 [2022-11-03 03:50:17,722 INFO L226 Difference]: Without dead ends: 6164 [2022-11-03 03:50:17,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:50:17,725 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:17,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 123 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 03:50:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6164 states. [2022-11-03 03:50:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6164 to 5349. [2022-11-03 03:50:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5349 states, 5343 states have (on average 3.9651880965749577) internal successors, (21186), 5348 states have internal predecessors, (21186), 0 states have call successors, (0), 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:50:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5349 states to 5349 states and 21186 transitions. [2022-11-03 03:50:17,914 INFO L78 Accepts]: Start accepts. Automaton has 5349 states and 21186 transitions. Word has length 18 [2022-11-03 03:50:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:17,915 INFO L495 AbstractCegarLoop]: Abstraction has 5349 states and 21186 transitions. [2022-11-03 03:50:17,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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:50:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5349 states and 21186 transitions. [2022-11-03 03:50:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:50:17,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:17,920 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:50:17,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:50:17,921 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash 702010428, now seen corresponding path program 1 times [2022-11-03 03:50:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:17,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809030418] [2022-11-03 03:50:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:19,296 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:50:19,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:19,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809030418] [2022-11-03 03:50:19,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809030418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:19,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:19,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:50:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004152562] [2022-11-03 03:50:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:19,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:50:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:19,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:50:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:50:19,299 INFO L87 Difference]: Start difference. First operand 5349 states and 21186 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:50:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:20,675 INFO L93 Difference]: Finished difference Result 14267 states and 56794 transitions. [2022-11-03 03:50:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:50:20,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 21 [2022-11-03 03:50:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:20,764 INFO L225 Difference]: With dead ends: 14267 [2022-11-03 03:50:20,765 INFO L226 Difference]: Without dead ends: 14267 [2022-11-03 03:50:20,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:50:20,766 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 338 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:20,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 93 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 03:50:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14267 states. [2022-11-03 03:50:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14267 to 6490. [2022-11-03 03:50:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6484 states have (on average 4.069864281307835) internal successors, (26389), 6489 states have internal predecessors, (26389), 0 states have call successors, (0), 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:50:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 26389 transitions. [2022-11-03 03:50:21,083 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 26389 transitions. Word has length 21 [2022-11-03 03:50:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:21,083 INFO L495 AbstractCegarLoop]: Abstraction has 6490 states and 26389 transitions. [2022-11-03 03:50:21,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:50:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 26389 transitions. [2022-11-03 03:50:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:50:21,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:21,088 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:50:21,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:50:21,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash -447894692, now seen corresponding path program 1 times [2022-11-03 03:50:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:21,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602823451] [2022-11-03 03:50:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:21,991 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:50:21,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:21,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602823451] [2022-11-03 03:50:21,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602823451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:21,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:21,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 03:50:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534882000] [2022-11-03 03:50:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:21,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 03:50:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:21,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 03:50:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-03 03:50:21,993 INFO L87 Difference]: Start difference. First operand 6490 states and 26389 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:50:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:23,620 INFO L93 Difference]: Finished difference Result 6105 states and 24727 transitions. [2022-11-03 03:50:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:50:23,621 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 21 [2022-11-03 03:50:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:23,654 INFO L225 Difference]: With dead ends: 6105 [2022-11-03 03:50:23,654 INFO L226 Difference]: Without dead ends: 6105 [2022-11-03 03:50:23,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:50:23,655 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 221 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:23,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 108 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 03:50:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2022-11-03 03:50:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 4565. [2022-11-03 03:50:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4565 states, 4562 states have (on average 3.962954844366506) internal successors, (18079), 4564 states have internal predecessors, (18079), 0 states have call successors, (0), 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:50:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 18079 transitions. [2022-11-03 03:50:23,822 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 18079 transitions. Word has length 21 [2022-11-03 03:50:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:23,822 INFO L495 AbstractCegarLoop]: Abstraction has 4565 states and 18079 transitions. [2022-11-03 03:50:23,822 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:50:23,823 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 18079 transitions. [2022-11-03 03:50:23,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:50:23,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:23,829 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:50:23,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:50:23,829 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1650840386, now seen corresponding path program 2 times [2022-11-03 03:50:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:23,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912345567] [2022-11-03 03:50:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:25,253 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:50:25,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:25,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912345567] [2022-11-03 03:50:25,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912345567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:25,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:25,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 03:50:25,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75672852] [2022-11-03 03:50:25,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:25,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 03:50:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 03:50:25,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:50:25,255 INFO L87 Difference]: Start difference. First operand 4565 states and 18079 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:50:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:26,706 INFO L93 Difference]: Finished difference Result 11314 states and 44952 transitions. [2022-11-03 03:50:26,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 03:50:26,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 21 [2022-11-03 03:50:26,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:26,783 INFO L225 Difference]: With dead ends: 11314 [2022-11-03 03:50:26,783 INFO L226 Difference]: Without dead ends: 11314 [2022-11-03 03:50:26,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-11-03 03:50:26,784 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 278 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:26,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 113 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 03:50:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11314 states. [2022-11-03 03:50:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11314 to 4639. [2022-11-03 03:50:27,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 4636 states have (on average 3.9715271786022432) internal successors, (18412), 4638 states have internal predecessors, (18412), 0 states have call successors, (0), 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:50:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 18412 transitions. [2022-11-03 03:50:27,076 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 18412 transitions. Word has length 21 [2022-11-03 03:50:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:27,076 INFO L495 AbstractCegarLoop]: Abstraction has 4639 states and 18412 transitions. [2022-11-03 03:50:27,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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:50:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 18412 transitions. [2022-11-03 03:50:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 03:50:27,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:27,085 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:50:27,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:50:27,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:27,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:27,086 INFO L85 PathProgramCache]: Analyzing trace with hash 178905827, now seen corresponding path program 1 times [2022-11-03 03:50:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:27,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969305941] [2022-11-03 03:50:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:27,488 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:50:27,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:27,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969305941] [2022-11-03 03:50:27,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969305941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:50:27,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:50:27,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:50:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728057991] [2022-11-03 03:50:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:50:27,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:50:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:50:27,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:50:27,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:50:27,490 INFO L87 Difference]: Start difference. First operand 4639 states and 18412 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:50:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:50:28,600 INFO L93 Difference]: Finished difference Result 5044 states and 20036 transitions. [2022-11-03 03:50:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:50:28,601 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 22 [2022-11-03 03:50:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:50:28,625 INFO L225 Difference]: With dead ends: 5044 [2022-11-03 03:50:28,625 INFO L226 Difference]: Without dead ends: 5044 [2022-11-03 03:50:28,626 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:50:28,626 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 56 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:50:28,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 56 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 03:50:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2022-11-03 03:50:28,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 5044. [2022-11-03 03:50:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5044 states, 5041 states have (on average 3.974608212656219) internal successors, (20036), 5043 states have internal predecessors, (20036), 0 states have call successors, (0), 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:50:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 20036 transitions. [2022-11-03 03:50:28,866 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 20036 transitions. Word has length 22 [2022-11-03 03:50:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:50:28,867 INFO L495 AbstractCegarLoop]: Abstraction has 5044 states and 20036 transitions. [2022-11-03 03:50:28,867 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:50:28,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 20036 transitions. [2022-11-03 03:50:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:50:28,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:50:28,875 INFO L195 NwaCegarLoop]: trace histogram [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:50:28,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:50:28,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:50:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:50:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1199379797, now seen corresponding path program 3 times [2022-11-03 03:50:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:50:28,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727634872] [2022-11-03 03:50:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:50:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:50:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:50:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:50:29,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:50:29,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727634872] [2022-11-03 03:50:29,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727634872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:50:29,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631315053] [2022-11-03 03:50:29,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:50:29,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:50:29,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:50:29,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:50:29,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:51:05,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:51:05,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:05,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:51:05,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:51:05,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:51:05,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631315053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:05,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [425311479] [2022-11-03 03:51:05,489 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:51:05,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:05,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-03 03:51:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181975443] [2022-11-03 03:51:05,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:05,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:51:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:51:05,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:51:05,495 INFO L87 Difference]: Start difference. First operand 5044 states and 20036 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:06,880 INFO L93 Difference]: Finished difference Result 19627 states and 75949 transitions. [2022-11-03 03:51:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 03:51:06,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:51:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:06,958 INFO L225 Difference]: With dead ends: 19627 [2022-11-03 03:51:06,959 INFO L226 Difference]: Without dead ends: 19627 [2022-11-03 03:51:06,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:51:06,960 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 900 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:06,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 564 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 03:51:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19627 states. [2022-11-03 03:51:07,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19627 to 9419. [2022-11-03 03:51:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9419 states, 9416 states have (on average 4.076359388275276) internal successors, (38383), 9418 states have internal predecessors, (38383), 0 states have call successors, (0), 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:51:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 38383 transitions. [2022-11-03 03:51:07,384 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 38383 transitions. Word has length 23 [2022-11-03 03:51:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:07,385 INFO L495 AbstractCegarLoop]: Abstraction has 9419 states and 38383 transitions. [2022-11-03 03:51:07,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 38383 transitions. [2022-11-03 03:51:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:51:07,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:07,397 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] [2022-11-03 03:51:07,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:07,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:51:07,620 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:51:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:07,620 INFO L85 PathProgramCache]: Analyzing trace with hash 681196643, now seen corresponding path program 1 times [2022-11-03 03:51:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803910801] [2022-11-03 03:51:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:07,963 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:51:07,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:07,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803910801] [2022-11-03 03:51:07,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803910801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:07,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:07,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 03:51:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714565649] [2022-11-03 03:51:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:07,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:51:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:07,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:51:07,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:51:07,965 INFO L87 Difference]: Start difference. First operand 9419 states and 38383 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:08,744 INFO L93 Difference]: Finished difference Result 9494 states and 38593 transitions. [2022-11-03 03:51:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:51:08,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 03:51:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:08,787 INFO L225 Difference]: With dead ends: 9494 [2022-11-03 03:51:08,787 INFO L226 Difference]: Without dead ends: 7217 [2022-11-03 03:51:08,787 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:51:08,788 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:08,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 57 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 03:51:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217 states. [2022-11-03 03:51:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7217 to 7217. [2022-11-03 03:51:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7217 states, 7214 states have (on average 3.861796506792348) internal successors, (27859), 7216 states have internal predecessors, (27859), 0 states have call successors, (0), 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:51:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7217 states to 7217 states and 27859 transitions. [2022-11-03 03:51:09,030 INFO L78 Accepts]: Start accepts. Automaton has 7217 states and 27859 transitions. Word has length 25 [2022-11-03 03:51:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:09,030 INFO L495 AbstractCegarLoop]: Abstraction has 7217 states and 27859 transitions. [2022-11-03 03:51:09,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7217 states and 27859 transitions. [2022-11-03 03:51:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:51:09,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:09,038 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:51:09,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:51:09,039 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:51:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2125110833, now seen corresponding path program 4 times [2022-11-03 03:51:09,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:09,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874173264] [2022-11-03 03:51:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:51:10,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:10,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874173264] [2022-11-03 03:51:10,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874173264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:10,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204635287] [2022-11-03 03:51:10,541 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:51:10,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:10,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:10,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:10,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:51:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:10,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-03 03:51:10,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:10,920 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:51:10,921 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:51:11,029 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:51:11,030 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:51:11,147 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:51:11,147 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:51:11,619 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:51:11,708 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:51:11,842 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:51:11,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 03:51:12,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:51:12,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 116 [2022-11-03 03:51:12,195 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:51:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:51:16,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:51:16,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204635287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:16,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:51:16,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 24 [2022-11-03 03:51:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704173413] [2022-11-03 03:51:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:16,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:51:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:51:16,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=519, Unknown=1, NotChecked=0, Total=650 [2022-11-03 03:51:16,340 INFO L87 Difference]: Start difference. First operand 7217 states and 27859 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:51:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:25,123 INFO L93 Difference]: Finished difference Result 11803 states and 45964 transitions. [2022-11-03 03:51:25,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 03:51:25,124 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 26 [2022-11-03 03:51:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:25,183 INFO L225 Difference]: With dead ends: 11803 [2022-11-03 03:51:25,183 INFO L226 Difference]: Without dead ends: 11618 [2022-11-03 03:51:25,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=354, Invalid=975, Unknown=3, NotChecked=0, Total=1332 [2022-11-03 03:51:25,184 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 340 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:25,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 207 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 709 Invalid, 0 Unknown, 239 Unchecked, 2.1s Time] [2022-11-03 03:51:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11618 states. [2022-11-03 03:51:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11618 to 7143. [2022-11-03 03:51:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7143 states, 7140 states have (on average 3.8603641456582634) internal successors, (27563), 7142 states have internal predecessors, (27563), 0 states have call successors, (0), 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:51:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7143 states to 7143 states and 27563 transitions. [2022-11-03 03:51:25,553 INFO L78 Accepts]: Start accepts. Automaton has 7143 states and 27563 transitions. Word has length 26 [2022-11-03 03:51:25,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:25,553 INFO L495 AbstractCegarLoop]: Abstraction has 7143 states and 27563 transitions. [2022-11-03 03:51:25,554 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:51:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7143 states and 27563 transitions. [2022-11-03 03:51:25,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 03:51:25,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:25,561 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] [2022-11-03 03:51:25,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:25,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 03:51:25,781 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:51:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash -381868197, now seen corresponding path program 1 times [2022-11-03 03:51:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:25,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168399052] [2022-11-03 03:51:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:27,247 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:51:27,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:27,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168399052] [2022-11-03 03:51:27,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168399052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:51:27,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:51:27,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 03:51:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159128042] [2022-11-03 03:51:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:27,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 03:51:27,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:27,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 03:51:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-03 03:51:27,249 INFO L87 Difference]: Start difference. First operand 7143 states and 27563 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:51:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:28,807 INFO L93 Difference]: Finished difference Result 6958 states and 26823 transitions. [2022-11-03 03:51:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 03:51:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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 27 [2022-11-03 03:51:28,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:28,837 INFO L225 Difference]: With dead ends: 6958 [2022-11-03 03:51:28,837 INFO L226 Difference]: Without dead ends: 6514 [2022-11-03 03:51:28,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:51:28,840 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 171 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:28,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 94 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 03:51:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6514 states. [2022-11-03 03:51:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6514 to 6218. [2022-11-03 03:51:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 3.833011583011583) internal successors, (23826), 6217 states have internal predecessors, (23826), 0 states have call successors, (0), 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:51:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 23826 transitions. [2022-11-03 03:51:29,021 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 23826 transitions. Word has length 27 [2022-11-03 03:51:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:29,021 INFO L495 AbstractCegarLoop]: Abstraction has 6218 states and 23826 transitions. [2022-11-03 03:51:29,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:51:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 23826 transitions. [2022-11-03 03:51:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 03:51:29,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:29,033 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, 1, 1, 1] [2022-11-03 03:51:29,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:51:29,033 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:51:29,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash -567363240, now seen corresponding path program 1 times [2022-11-03 03:51:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:29,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86631664] [2022-11-03 03:51:29,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:29,193 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:51:29,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:29,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86631664] [2022-11-03 03:51:29,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86631664] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:29,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913203613] [2022-11-03 03:51:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:29,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:29,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:29,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:29,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:51:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:29,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:51:29,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:29,557 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:51:29,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:51:29,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913203613] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:29,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 03:51:29,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-11-03 03:51:29,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154657507] [2022-11-03 03:51:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:51:29,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:51:29,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:51:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 03:51:29,642 INFO L87 Difference]: Start difference. First operand 6218 states and 23826 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:29,988 INFO L93 Difference]: Finished difference Result 6218 states and 23600 transitions. [2022-11-03 03:51:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:51:29,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 03:51:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:30,012 INFO L225 Difference]: With dead ends: 6218 [2022-11-03 03:51:30,012 INFO L226 Difference]: Without dead ends: 6218 [2022-11-03 03:51:30,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 03:51:30,013 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 83 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:30,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 40 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:51:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6218 states. [2022-11-03 03:51:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6218 to 6218. [2022-11-03 03:51:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 3.7966537966537968) internal successors, (23600), 6217 states have internal predecessors, (23600), 0 states have call successors, (0), 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:51:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 23600 transitions. [2022-11-03 03:51:30,189 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 23600 transitions. Word has length 31 [2022-11-03 03:51:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:30,189 INFO L495 AbstractCegarLoop]: Abstraction has 6218 states and 23600 transitions. [2022-11-03 03:51:30,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:51:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 23600 transitions. [2022-11-03 03:51:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 03:51:30,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:30,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:51:30,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:30,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 03:51:30,417 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:51:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1517075950, now seen corresponding path program 1 times [2022-11-03 03:51:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:30,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512430354] [2022-11-03 03:51:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:30,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:51:30,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:30,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512430354] [2022-11-03 03:51:30,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512430354] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:30,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132856656] [2022-11-03 03:51:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:30,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:30,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:30,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:30,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:51:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:30,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:51:30,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:51:31,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:51:31,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132856656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:31,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1060559705] [2022-11-03 03:51:31,273 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:51:31,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:31,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-03 03:51:31,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357908957] [2022-11-03 03:51:31,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:31,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:51:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:51:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:51:31,275 INFO L87 Difference]: Start difference. First operand 6218 states and 23600 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 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:51:32,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:51:32,369 INFO L93 Difference]: Finished difference Result 7397 states and 27285 transitions. [2022-11-03 03:51:32,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:51:32,370 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 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:51:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:51:32,388 INFO L225 Difference]: With dead ends: 7397 [2022-11-03 03:51:32,389 INFO L226 Difference]: Without dead ends: 7397 [2022-11-03 03:51:32,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-11-03 03:51:32,390 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 448 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:51:32,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 238 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 03:51:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7397 states. [2022-11-03 03:51:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7397 to 5283. [2022-11-03 03:51:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5283 states, 5281 states have (on average 3.7640598371520544) internal successors, (19878), 5282 states have internal predecessors, (19878), 0 states have call successors, (0), 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:51:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 19878 transitions. [2022-11-03 03:51:32,550 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 19878 transitions. Word has length 34 [2022-11-03 03:51:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:51:32,550 INFO L495 AbstractCegarLoop]: Abstraction has 5283 states and 19878 transitions. [2022-11-03 03:51:32,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 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:51:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 19878 transitions. [2022-11-03 03:51:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 03:51:32,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:51:32,562 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:51:32,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:51:32,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 03:51:32,777 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:51:32,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:51:32,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1132706472, now seen corresponding path program 2 times [2022-11-03 03:51:32,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:51:32,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590004631] [2022-11-03 03:51:32,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:51:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:51:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:51:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:51:34,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:51:34,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590004631] [2022-11-03 03:51:34,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590004631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:51:34,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444964842] [2022-11-03 03:51:34,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:51:34,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:51:34,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:51:34,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:51:34,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:51:34,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 03:51:34,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:51:34,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 03:51:34,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:51:34,940 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 03:51:34,941 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:51:35,013 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 03:51:35,013 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:51:35,119 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 03:51:35,119 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:51:35,439 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:51:35,503 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:51:35,650 INFO L356 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-03 03:51:35,651 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 69 treesize of output 86 [2022-11-03 03:51:35,663 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 80 treesize of output 74 [2022-11-03 03:51:44,826 INFO L356 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-03 03:51:44,826 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:51:48,520 INFO L356 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-03 03:51:48,520 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:51:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 03:51:50,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:51:50,185 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)))) is different from false [2022-11-03 03:51:52,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse2 1))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) .cse4 0))) (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse4) 0)))))) is different from false [2022-11-03 03:51:52,342 INFO L356 Elim1Store]: treesize reduction 372, result has 17.1 percent of original size [2022-11-03 03:51:52,342 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:51:52,363 INFO L356 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-11-03 03:51:52,363 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 230 treesize of output 160 [2022-11-03 03:51:52,378 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 60 treesize of output 46 [2022-11-03 03:51:52,383 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 106 treesize of output 78 [2022-11-03 03:51:52,449 INFO L356 Elim1Store]: treesize reduction 448, result has 0.2 percent of original size [2022-11-03 03:51:52,449 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:51:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2022-11-03 03:51:52,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444964842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:51:52,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924875516] [2022-11-03 03:51:52,791 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:51:52,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:51:52,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2022-11-03 03:51:52,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252097540] [2022-11-03 03:51:52,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:51:52,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:51:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:51:52,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:51:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=508, Unknown=9, NotChecked=94, Total=702 [2022-11-03 03:51:52,794 INFO L87 Difference]: Start difference. First operand 5283 states and 19878 transitions. Second operand has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 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:51:55,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse5 1))) (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse4) 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_thread1Thread1of1ForFork1_~i~0 0) (= (select .cse0 .cse4) 0)))) is different from false [2022-11-03 03:52:08,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse5 1))) (and (not (= c_thread2Thread1of1ForFork2_~i~1 c_thread1Thread1of1ForFork1_~i~0)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse4) 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_thread1Thread1of1ForFork1_~i~0 0) (= (select .cse0 .cse4) 0)))) is different from false [2022-11-03 03:52:34,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse5 (+ c_~A~0.offset .cse6 1))) (let ((.cse2 (+ c_~A~0.offset .cse6)) (.cse0 (store .cse3 .cse5 0))) (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse2) 0)) (= (select .cse3 .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)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse5) 0)))))) is different from false [2022-11-03 03:52:36,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse5 1))) (and (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse4) 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)) (= (select .cse0 .cse4) 0)))) is different from false [2022-11-03 03:52:38,104 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse5 (+ c_~A~0.offset .cse6 1))) (let ((.cse2 (+ c_~A~0.offset .cse6)) (.cse0 (store .cse3 .cse5 0))) (and (not (= c_thread2Thread1of1ForFork2_~i~1 c_thread1Thread1of1ForFork1_~i~0)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse2) 0)) (= (select .cse3 .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)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset 2 .cse4) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse5) 0)))))) is different from false [2022-11-03 03:52:40,087 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse5 1))) (and (not (= c_thread2Thread1of1ForFork2_~i~1 c_thread1Thread1of1ForFork1_~i~0)) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork2_~i~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 .cse1 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse2) 0)) (= (select .cse0 .cse2) 0) (forall ((v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1884 (Array Int Int)) (thread2Thread1of1ForFork2_~i~1 Int)) (= (select (select (store (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~B~0.base v_ArrVal_1884) c_~C~0.base v_ArrVal_1887) c_~A~0.base) .cse4) 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)) (= (select .cse0 .cse4) 0)))) is different from false [2022-11-03 03:52:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:52:40,256 INFO L93 Difference]: Finished difference Result 22274 states and 85303 transitions. [2022-11-03 03:52:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-03 03:52:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 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:52:40,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:52:40,345 INFO L225 Difference]: With dead ends: 22274 [2022-11-03 03:52:40,346 INFO L226 Difference]: Without dead ends: 22274 [2022-11-03 03:52:40,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 60.2s TimeCoverageRelationStatistics Valid=506, Invalid=2040, Unknown=36, NotChecked=840, Total=3422 [2022-11-03 03:52:40,347 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 605 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 3097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1451 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:52:40,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 610 Invalid, 3097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1550 Invalid, 0 Unknown, 1451 Unchecked, 3.8s Time] [2022-11-03 03:52:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22274 states. [2022-11-03 03:52:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22274 to 8684. [2022-11-03 03:52:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8684 states, 8682 states have (on average 3.912808108730707) internal successors, (33971), 8683 states have internal predecessors, (33971), 0 states have call successors, (0), 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:52:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8684 states to 8684 states and 33971 transitions. [2022-11-03 03:52:40,699 INFO L78 Accepts]: Start accepts. Automaton has 8684 states and 33971 transitions. Word has length 37 [2022-11-03 03:52:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:52:40,699 INFO L495 AbstractCegarLoop]: Abstraction has 8684 states and 33971 transitions. [2022-11-03 03:52:40,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 0 states have call successors, (0), 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:52:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8684 states and 33971 transitions. [2022-11-03 03:52:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 03:52:40,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:52:40,713 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:52:40,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:52:40,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:52:40,914 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-03 03:52:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:52:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1120251912, now seen corresponding path program 3 times [2022-11-03 03:52:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:52:40,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387224914] [2022-11-03 03:52:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:52:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:52:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:52:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 03:52:42,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:52:42,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387224914] [2022-11-03 03:52:42,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387224914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:52:42,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930518618] [2022-11-03 03:52:42,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:52:42,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:52:42,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:52:42,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:52:42,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e19c2d8a-b24a-498f-8cd6-190f679b2dd0/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process