./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b 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_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-20.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 012c46975e61d3a8df350de2a682cb9d47f59406509497c2ea72a562542ce55a --- 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-8393723 [2022-11-18 20:50:07,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:50:07,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:50:07,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:50:07,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:50:07,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:50:07,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:50:07,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:50:07,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:50:07,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:50:07,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:50:07,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:50:07,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:50:07,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:50:07,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:50:07,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:50:07,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:50:07,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:50:07,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:50:07,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:50:07,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:50:07,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:50:07,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:50:07,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:50:07,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:50:07,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:50:07,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:50:07,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:50:07,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:50:07,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:50:07,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:50:07,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:50:07,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:50:07,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:50:07,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:50:07,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:50:07,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:50:07,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:50:07,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:50:07,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:50:07,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:50:07,420 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-18 20:50:07,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:50:07,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:50:07,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:50:07,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:50:07,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:50:07,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:50:07,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:50:07,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:50:07,455 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:50:07,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:50:07,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:50:07,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:50:07,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:50:07,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:50:07,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:50:07,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:50:07,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:50:07,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:50:07,458 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-18 20:50:07,458 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:50:07,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:50:07,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:50:07,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:50:07,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:50:07,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:50:07,465 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:50:07,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:50:07,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:50:07,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:50:07,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:50:07,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:50:07,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:50:07,469 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:50:07,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:50:07,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:50:07,469 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_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/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_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro 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 -> Automizer 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 -> 012c46975e61d3a8df350de2a682cb9d47f59406509497c2ea72a562542ce55a [2022-11-18 20:50:07,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:50:07,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:50:07,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:50:07,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:50:07,844 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:50:07,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-deagle/airline-20.i [2022-11-18 20:50:07,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/data/eccc482b2/9a2d48d9ba2745bb9543ed8312559d1c/FLAGc693d666f [2022-11-18 20:50:08,495 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:50:08,500 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/sv-benchmarks/c/pthread-deagle/airline-20.i [2022-11-18 20:50:08,521 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/data/eccc482b2/9a2d48d9ba2745bb9543ed8312559d1c/FLAGc693d666f [2022-11-18 20:50:08,772 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/data/eccc482b2/9a2d48d9ba2745bb9543ed8312559d1c [2022-11-18 20:50:08,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:50:08,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:50:08,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:50:08,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:50:08,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:50:08,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:50:08" (1/1) ... [2022-11-18 20:50:08,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bf924b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:08, skipping insertion in model container [2022-11-18 20:50:08,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:50:08" (1/1) ... [2022-11-18 20:50:08,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:50:08,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:50:09,230 WARN L234 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_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/sv-benchmarks/c/pthread-deagle/airline-20.i[32101,32114] [2022-11-18 20:50:09,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:50:09,238 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:50:09,275 WARN L234 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_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/sv-benchmarks/c/pthread-deagle/airline-20.i[32101,32114] [2022-11-18 20:50:09,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:50:09,307 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:50:09,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09 WrapperNode [2022-11-18 20:50:09,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:50:09,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:50:09,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:50:09,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:50:09,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,388 INFO L138 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-18 20:50:09,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:50:09,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:50:09,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:50:09,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:50:09,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,425 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:50:09,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:50:09,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:50:09,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:50:09,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (1/1) ... [2022-11-18 20:50:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:50:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:09,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:50:09,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:50:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:50:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:50:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:50:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:50:09,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:50:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2022-11-18 20:50:09,503 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2022-11-18 20:50:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:50:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:50:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:50:09,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:50:09,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:50:09,505 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:50:09,637 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:50:09,639 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:50:09,906 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:50:09,979 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:50:09,979 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:50:09,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:50:09 BoogieIcfgContainer [2022-11-18 20:50:09,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:50:09,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:50:09,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:50:09,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:50:09,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:50:08" (1/3) ... [2022-11-18 20:50:09,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1824b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:50:09, skipping insertion in model container [2022-11-18 20:50:09,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:50:09" (2/3) ... [2022-11-18 20:50:09,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1824b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:50:09, skipping insertion in model container [2022-11-18 20:50:09,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:50:09" (3/3) ... [2022-11-18 20:50:09,993 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-20.i [2022-11-18 20:50:10,002 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:50:10,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:50:10,022 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-18 20:50:10,022 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:50:10,091 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-18 20:50:10,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 184 flow [2022-11-18 20:50:10,175 INFO L130 PetriNetUnfolder]: 9/119 cut-off events. [2022-11-18 20:50:10,175 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-18 20:50:10,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 119 events. 9/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-11-18 20:50:10,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 184 flow [2022-11-18 20:50:10,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 88 transitions, 184 flow [2022-11-18 20:50:10,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:50:10,222 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=PETRI_NET, 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;@7af11c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:50:10,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-18 20:50:10,234 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-18 20:50:10,235 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:50:10,235 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:10,236 INFO L209 CegarLoopForPetriNet]: 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-18 20:50:10,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-18 20:50:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1999147629, now seen corresponding path program 1 times [2022-11-18 20:50:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:10,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849321355] [2022-11-18 20:50:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:10,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:10,493 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-18 20:50:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849321355] [2022-11-18 20:50:10,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849321355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:10,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:10,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:50:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287728023] [2022-11-18 20:50:10,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:10,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:50:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:10,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:50:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:50:10,555 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88 [2022-11-18 20:50:10,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:50:10,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:10,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88 [2022-11-18 20:50:10,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:10,645 INFO L130 PetriNetUnfolder]: 3/106 cut-off events. [2022-11-18 20:50:10,646 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-18 20:50:10,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 106 events. 3/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 215 event pairs, 0 based on Foata normal form. 6/98 useless extension candidates. Maximal degree in co-relation 50. Up to 8 conditions per place. [2022-11-18 20:50:10,648 INFO L137 encePairwiseOnDemand]: 80/88 looper letters, 7 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2022-11-18 20:50:10,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 180 flow [2022-11-18 20:50:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:50:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 20:50:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions. [2022-11-18 20:50:10,667 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9034090909090909 [2022-11-18 20:50:10,668 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 159 transitions. [2022-11-18 20:50:10,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 159 transitions. [2022-11-18 20:50:10,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:10,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 159 transitions. [2022-11-18 20:50:10,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 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-18 20:50:10,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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-18 20:50:10,679 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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-18 20:50:10,681 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 184 flow. Second operand 2 states and 159 transitions. [2022-11-18 20:50:10,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 180 flow [2022-11-18 20:50:10,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:50:10,688 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow [2022-11-18 20:50:10,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2022-11-18 20:50:10,693 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2022-11-18 20:50:10,694 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow [2022-11-18 20:50:10,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:50:10,694 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:10,694 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-18 20:50:10,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:50:10,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-18 20:50:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash 676304161, now seen corresponding path program 1 times [2022-11-18 20:50:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700340081] [2022-11-18 20:50:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:10,839 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-18 20:50:10,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:10,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700340081] [2022-11-18 20:50:10,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700340081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:10,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:10,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:50:10,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501682381] [2022-11-18 20:50:10,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:10,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:10,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:10,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:10,845 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2022-11-18 20:50:10,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-18 20:50:10,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:10,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2022-11-18 20:50:10,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:10,915 INFO L130 PetriNetUnfolder]: 12/148 cut-off events. [2022-11-18 20:50:10,916 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 20:50:10,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 148 events. 12/148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 343 event pairs, 3 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 185. Up to 23 conditions per place. [2022-11-18 20:50:10,917 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 16 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-11-18 20:50:10,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 210 flow [2022-11-18 20:50:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-11-18 20:50:10,920 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2022-11-18 20:50:10,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2022-11-18 20:50:10,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2022-11-18 20:50:10,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:10,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2022-11-18 20:50:10,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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-18 20:50:10,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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-18 20:50:10,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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-18 20:50:10,925 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 214 transitions. [2022-11-18 20:50:10,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 210 flow [2022-11-18 20:50:10,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:50:10,928 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 174 flow [2022-11-18 20:50:10,928 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2022-11-18 20:50:10,929 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-18 20:50:10,929 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 174 flow [2022-11-18 20:50:10,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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-18 20:50:10,929 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:10,930 INFO L209 CegarLoopForPetriNet]: 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, 1] [2022-11-18 20:50:10,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:50:10,930 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-18 20:50:10,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:10,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1440702948, now seen corresponding path program 1 times [2022-11-18 20:50:10,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:10,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768235923] [2022-11-18 20:50:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:10,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:10,994 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-18 20:50:10,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:10,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768235923] [2022-11-18 20:50:10,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768235923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:10,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:10,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:50:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799547848] [2022-11-18 20:50:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:10,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:10,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 88 [2022-11-18 20:50:10,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-18 20:50:10,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:10,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 88 [2022-11-18 20:50:10,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:11,060 INFO L130 PetriNetUnfolder]: 1/131 cut-off events. [2022-11-18 20:50:11,060 INFO L131 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2022-11-18 20:50:11,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 131 events. 1/131 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 150. Up to 7 conditions per place. [2022-11-18 20:50:11,062 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-11-18 20:50:11,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 197 flow [2022-11-18 20:50:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:11,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-11-18 20:50:11,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8257575757575758 [2022-11-18 20:50:11,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2022-11-18 20:50:11,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2022-11-18 20:50:11,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:11,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2022-11-18 20:50:11,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-18 20:50:11,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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-18 20:50:11,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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-18 20:50:11,069 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 174 flow. Second operand 3 states and 218 transitions. [2022-11-18 20:50:11,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 197 flow [2022-11-18 20:50:11,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:50:11,072 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 172 flow [2022-11-18 20:50:11,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2022-11-18 20:50:11,074 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2022-11-18 20:50:11,074 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 172 flow [2022-11-18 20:50:11,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-18 20:50:11,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:11,075 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1] [2022-11-18 20:50:11,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:50:11,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-18 20:50:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash 373619005, now seen corresponding path program 1 times [2022-11-18 20:50:11,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:11,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445916274] [2022-11-18 20:50:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,138 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-18 20:50:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:11,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445916274] [2022-11-18 20:50:11,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445916274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:11,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:11,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:50:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227170910] [2022-11-18 20:50:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:11,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:11,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2022-11-18 20:50:11,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-18 20:50:11,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:11,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2022-11-18 20:50:11,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:11,210 INFO L130 PetriNetUnfolder]: 7/188 cut-off events. [2022-11-18 20:50:11,211 INFO L131 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2022-11-18 20:50:11,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 188 events. 7/188 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 580 event pairs, 4 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 231. Up to 23 conditions per place. [2022-11-18 20:50:11,213 INFO L137 encePairwiseOnDemand]: 82/88 looper letters, 11 selfloop transitions, 3 changer transitions 11/81 dead transitions. [2022-11-18 20:50:11,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 213 flow [2022-11-18 20:50:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-11-18 20:50:11,215 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2022-11-18 20:50:11,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2022-11-18 20:50:11,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2022-11-18 20:50:11,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:11,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2022-11-18 20:50:11,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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-18 20:50:11,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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-18 20:50:11,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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-18 20:50:11,219 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 172 flow. Second operand 3 states and 216 transitions. [2022-11-18 20:50:11,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 213 flow [2022-11-18 20:50:11,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:50:11,223 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 168 flow [2022-11-18 20:50:11,223 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2022-11-18 20:50:11,224 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-18 20:50:11,224 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 168 flow [2022-11-18 20:50:11,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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-18 20:50:11,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:11,225 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:11,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:50:11,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-18 20:50:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1959545260, now seen corresponding path program 1 times [2022-11-18 20:50:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:11,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701292753] [2022-11-18 20:50:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:50:11,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:50:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:50:11,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:50:11,295 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:50:11,296 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2022-11-18 20:50:11,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-11-18 20:50:11,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-11-18 20:50:11,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-11-18 20:50:11,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-11-18 20:50:11,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-11-18 20:50:11,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-11-18 20:50:11,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-11-18 20:50:11,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-11-18 20:50:11,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-11-18 20:50:11,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-11-18 20:50:11,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-11-18 20:50:11,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-11-18 20:50:11,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-11-18 20:50:11,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:50:11,305 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-18 20:50:11,308 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 20:50:11,308 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-18 20:50:11,354 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:50:11,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 234 flow [2022-11-18 20:50:11,409 INFO L130 PetriNetUnfolder]: 18/209 cut-off events. [2022-11-18 20:50:11,410 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 20:50:11,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 209 events. 18/209 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 516 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2022-11-18 20:50:11,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 234 flow [2022-11-18 20:50:11,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 234 flow [2022-11-18 20:50:11,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:50:11,426 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=PETRI_NET, 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;@7af11c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:50:11,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-18 20:50:11,430 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-18 20:50:11,431 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:50:11,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:11,431 INFO L209 CegarLoopForPetriNet]: 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-18 20:50:11,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-18 20:50:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -746215681, now seen corresponding path program 1 times [2022-11-18 20:50:11,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:11,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645139922] [2022-11-18 20:50:11,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,477 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-18 20:50:11,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:11,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645139922] [2022-11-18 20:50:11,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645139922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:11,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:11,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:50:11,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244800432] [2022-11-18 20:50:11,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:11,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:50:11,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:11,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:50:11,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:50:11,492 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2022-11-18 20:50:11,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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-18 20:50:11,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:11,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2022-11-18 20:50:11,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:11,553 INFO L130 PetriNetUnfolder]: 16/208 cut-off events. [2022-11-18 20:50:11,553 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-11-18 20:50:11,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 208 events. 16/208 cut-off events. For 36/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 642 event pairs, 1 based on Foata normal form. 18/197 useless extension candidates. Maximal degree in co-relation 116. Up to 27 conditions per place. [2022-11-18 20:50:11,555 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 11 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2022-11-18 20:50:11,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 234 flow [2022-11-18 20:50:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:50:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 20:50:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-11-18 20:50:11,561 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2022-11-18 20:50:11,562 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2022-11-18 20:50:11,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2022-11-18 20:50:11,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:11,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2022-11-18 20:50:11,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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-18 20:50:11,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-18 20:50:11,570 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-18 20:50:11,570 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 234 flow. Second operand 2 states and 193 transitions. [2022-11-18 20:50:11,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 234 flow [2022-11-18 20:50:11,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:50:11,576 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 212 flow [2022-11-18 20:50:11,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=212, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2022-11-18 20:50:11,580 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places. [2022-11-18 20:50:11,580 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 212 flow [2022-11-18 20:50:11,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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-18 20:50:11,581 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:11,581 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-18 20:50:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:50:11,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-18 20:50:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1859938163, now seen corresponding path program 1 times [2022-11-18 20:50:11,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:11,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803094403] [2022-11-18 20:50:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:11,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:11,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803094403] [2022-11-18 20:50:11,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803094403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:11,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:11,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:50:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126185492] [2022-11-18 20:50:11,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:11,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:11,679 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2022-11-18 20:50:11,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-18 20:50:11,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:11,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2022-11-18 20:50:11,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:11,775 INFO L130 PetriNetUnfolder]: 68/423 cut-off events. [2022-11-18 20:50:11,776 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-18 20:50:11,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 423 events. 68/423 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2061 event pairs, 9 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 562. Up to 103 conditions per place. [2022-11-18 20:50:11,779 INFO L137 encePairwiseOnDemand]: 105/108 looper letters, 22 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2022-11-18 20:50:11,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 272 flow [2022-11-18 20:50:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:11,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2022-11-18 20:50:11,781 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2022-11-18 20:50:11,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2022-11-18 20:50:11,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2022-11-18 20:50:11,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:11,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2022-11-18 20:50:11,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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-18 20:50:11,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-18 20:50:11,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-18 20:50:11,784 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 212 flow. Second operand 3 states and 262 transitions. [2022-11-18 20:50:11,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 272 flow [2022-11-18 20:50:11,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:50:11,787 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 224 flow [2022-11-18 20:50:11,788 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2022-11-18 20:50:11,788 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -4 predicate places. [2022-11-18 20:50:11,788 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 224 flow [2022-11-18 20:50:11,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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-18 20:50:11,789 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:11,789 INFO L209 CegarLoopForPetriNet]: 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, 1] [2022-11-18 20:50:11,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:50:11,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-18 20:50:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1310943378, now seen corresponding path program 1 times [2022-11-18 20:50:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:11,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596307389] [2022-11-18 20:50:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:11,822 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-18 20:50:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:11,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596307389] [2022-11-18 20:50:11,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596307389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:11,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:11,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:50:11,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809931054] [2022-11-18 20:50:11,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:11,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:11,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:11,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:11,825 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-11-18 20:50:11,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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-18 20:50:11,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:11,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-11-18 20:50:11,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:11,962 INFO L130 PetriNetUnfolder]: 52/631 cut-off events. [2022-11-18 20:50:11,962 INFO L131 PetriNetUnfolder]: For 111/313 co-relation queries the response was YES. [2022-11-18 20:50:11,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 631 events. 52/631 cut-off events. For 111/313 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3962 event pairs, 10 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 780. Up to 52 conditions per place. [2022-11-18 20:50:11,967 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 22 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2022-11-18 20:50:11,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 313 flow [2022-11-18 20:50:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-11-18 20:50:11,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-11-18 20:50:11,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-11-18 20:50:11,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-11-18 20:50:11,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:11,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-11-18 20:50:11,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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-18 20:50:11,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-18 20:50:11,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-18 20:50:11,972 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 224 flow. Second operand 3 states and 270 transitions. [2022-11-18 20:50:11,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 313 flow [2022-11-18 20:50:11,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:50:11,980 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 274 flow [2022-11-18 20:50:11,980 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2022-11-18 20:50:11,981 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2022-11-18 20:50:11,982 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 274 flow [2022-11-18 20:50:11,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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-18 20:50:11,983 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:11,983 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1] [2022-11-18 20:50:11,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:50:11,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-18 20:50:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:11,985 INFO L85 PathProgramCache]: Analyzing trace with hash 176942779, now seen corresponding path program 1 times [2022-11-18 20:50:11,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:11,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826439184] [2022-11-18 20:50:11,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:11,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:12,038 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-18 20:50:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826439184] [2022-11-18 20:50:12,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826439184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:12,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:12,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:50:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759179482] [2022-11-18 20:50:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:12,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:12,046 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2022-11-18 20:50:12,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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-18 20:50:12,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:12,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2022-11-18 20:50:12,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:12,333 INFO L130 PetriNetUnfolder]: 266/1659 cut-off events. [2022-11-18 20:50:12,333 INFO L131 PetriNetUnfolder]: For 362/767 co-relation queries the response was YES. [2022-11-18 20:50:12,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1659 events. 266/1659 cut-off events. For 362/767 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14100 event pairs, 91 based on Foata normal form. 1/1410 useless extension candidates. Maximal degree in co-relation 2425. Up to 383 conditions per place. [2022-11-18 20:50:12,345 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 27 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2022-11-18 20:50:12,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 389 flow [2022-11-18 20:50:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:12,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-11-18 20:50:12,346 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2022-11-18 20:50:12,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2022-11-18 20:50:12,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2022-11-18 20:50:12,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:12,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2022-11-18 20:50:12,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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-18 20:50:12,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-18 20:50:12,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 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-18 20:50:12,349 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 274 flow. Second operand 3 states and 267 transitions. [2022-11-18 20:50:12,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 389 flow [2022-11-18 20:50:12,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 117 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:50:12,354 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 332 flow [2022-11-18 20:50:12,355 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=105, PETRI_TRANSITIONS=112} [2022-11-18 20:50:12,355 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-11-18 20:50:12,356 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 332 flow [2022-11-18 20:50:12,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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-18 20:50:12,356 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:12,356 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:12,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:50:12,357 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-18 20:50:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1184394343, now seen corresponding path program 1 times [2022-11-18 20:50:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:12,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524417383] [2022-11-18 20:50:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:12,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524417383] [2022-11-18 20:50:12,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524417383] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:12,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586083297] [2022-11-18 20:50:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:12,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:12,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:12,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:12,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:50:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:12,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:50:12,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:12,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:12,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586083297] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:50:12,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:50:12,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 20:50:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115345361] [2022-11-18 20:50:12,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:12,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:50:12,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:12,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:50:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:50:12,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-11-18 20:50:12,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 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-18 20:50:12,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:12,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-11-18 20:50:12,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:12,971 INFO L130 PetriNetUnfolder]: 196/645 cut-off events. [2022-11-18 20:50:12,971 INFO L131 PetriNetUnfolder]: For 445/620 co-relation queries the response was YES. [2022-11-18 20:50:12,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 645 events. 196/645 cut-off events. For 445/620 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4598 event pairs, 5 based on Foata normal form. 47/623 useless extension candidates. Maximal degree in co-relation 1409. Up to 156 conditions per place. [2022-11-18 20:50:12,977 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 50 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2022-11-18 20:50:12,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 512 flow [2022-11-18 20:50:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:50:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:50:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2022-11-18 20:50:12,980 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7664609053497943 [2022-11-18 20:50:12,980 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2022-11-18 20:50:12,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2022-11-18 20:50:12,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:12,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2022-11-18 20:50:12,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 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-18 20:50:12,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 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-18 20:50:12,985 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 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-18 20:50:12,986 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 332 flow. Second operand 9 states and 745 transitions. [2022-11-18 20:50:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 512 flow [2022-11-18 20:50:12,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-18 20:50:12,993 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 252 flow [2022-11-18 20:50:12,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2022-11-18 20:50:12,995 INFO L288 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2022-11-18 20:50:12,995 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 252 flow [2022-11-18 20:50:12,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 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-18 20:50:12,996 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:12,996 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:13,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 20:50:13,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:13,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-18 20:50:13,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:13,202 INFO L85 PathProgramCache]: Analyzing trace with hash 96829731, now seen corresponding path program 1 times [2022-11-18 20:50:13,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:13,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393300829] [2022-11-18 20:50:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:50:13,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:50:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:50:13,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:50:13,257 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:50:13,257 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2022-11-18 20:50:13,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2022-11-18 20:50:13,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2022-11-18 20:50:13,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2022-11-18 20:50:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2022-11-18 20:50:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2022-11-18 20:50:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2022-11-18 20:50:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2022-11-18 20:50:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2022-11-18 20:50:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2022-11-18 20:50:13,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2022-11-18 20:50:13,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2022-11-18 20:50:13,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2022-11-18 20:50:13,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2022-11-18 20:50:13,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2022-11-18 20:50:13,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2022-11-18 20:50:13,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2022-11-18 20:50:13,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2022-11-18 20:50:13,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:50:13,260 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-18 20:50:13,261 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 20:50:13,261 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-18 20:50:13,296 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 20:50:13,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 128 transitions, 286 flow [2022-11-18 20:50:13,350 INFO L130 PetriNetUnfolder]: 34/360 cut-off events. [2022-11-18 20:50:13,351 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-18 20:50:13,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 360 events. 34/360 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1103 event pairs, 1 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 217. Up to 16 conditions per place. [2022-11-18 20:50:13,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 128 transitions, 286 flow [2022-11-18 20:50:13,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 128 transitions, 286 flow [2022-11-18 20:50:13,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:50:13,361 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=PETRI_NET, 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;@7af11c23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:50:13,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-18 20:50:13,363 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-18 20:50:13,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:50:13,363 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:13,363 INFO L209 CegarLoopForPetriNet]: 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-18 20:50:13,363 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 579667839, now seen corresponding path program 1 times [2022-11-18 20:50:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:13,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048628942] [2022-11-18 20:50:13,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:13,381 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-18 20:50:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:13,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048628942] [2022-11-18 20:50:13,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048628942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:13,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:13,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-18 20:50:13,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348253199] [2022-11-18 20:50:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:13,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:50:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:50:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:50:13,384 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 128 [2022-11-18 20:50:13,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 286 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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-18 20:50:13,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:13,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 128 [2022-11-18 20:50:13,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:13,497 INFO L130 PetriNetUnfolder]: 84/453 cut-off events. [2022-11-18 20:50:13,497 INFO L131 PetriNetUnfolder]: For 191/217 co-relation queries the response was YES. [2022-11-18 20:50:13,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 453 events. 84/453 cut-off events. For 191/217 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1922 event pairs, 19 based on Foata normal form. 57/450 useless extension candidates. Maximal degree in co-relation 317. Up to 115 conditions per place. [2022-11-18 20:50:13,502 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 15 selfloop transitions, 0 changer transitions 0/115 dead transitions. [2022-11-18 20:50:13,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 290 flow [2022-11-18 20:50:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:50:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 20:50:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 227 transitions. [2022-11-18 20:50:13,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.88671875 [2022-11-18 20:50:13,505 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 227 transitions. [2022-11-18 20:50:13,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 227 transitions. [2022-11-18 20:50:13,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:13,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 227 transitions. [2022-11-18 20:50:13,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 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-18 20:50:13,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-18 20:50:13,509 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-18 20:50:13,509 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 286 flow. Second operand 2 states and 227 transitions. [2022-11-18 20:50:13,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 290 flow [2022-11-18 20:50:13,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:50:13,512 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 260 flow [2022-11-18 20:50:13,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2022-11-18 20:50:13,515 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places. [2022-11-18 20:50:13,515 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 260 flow [2022-11-18 20:50:13,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 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-18 20:50:13,515 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:13,515 INFO L209 CegarLoopForPetriNet]: 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] [2022-11-18 20:50:13,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:50:13,516 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash -93669107, now seen corresponding path program 1 times [2022-11-18 20:50:13,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:13,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247171198] [2022-11-18 20:50:13,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:13,557 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-18 20:50:13,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:13,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247171198] [2022-11-18 20:50:13,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247171198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:13,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:13,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:50:13,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596805847] [2022-11-18 20:50:13,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:13,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:13,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:13,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:13,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:13,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-18 20:50:13,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-18 20:50:13,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:13,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-18 20:50:13,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:13,788 INFO L130 PetriNetUnfolder]: 258/1209 cut-off events. [2022-11-18 20:50:13,788 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-11-18 20:50:13,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1209 events. 258/1209 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7825 event pairs, 58 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1666. Up to 347 conditions per place. [2022-11-18 20:50:13,801 INFO L137 encePairwiseOnDemand]: 125/128 looper letters, 26 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-11-18 20:50:13,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 328 flow [2022-11-18 20:50:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-11-18 20:50:13,802 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2022-11-18 20:50:13,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-11-18 20:50:13,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-11-18 20:50:13,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:13,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-11-18 20:50:13,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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-18 20:50:13,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 20:50:13,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 20:50:13,805 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 260 flow. Second operand 3 states and 308 transitions. [2022-11-18 20:50:13,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 328 flow [2022-11-18 20:50:13,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:50:13,809 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 272 flow [2022-11-18 20:50:13,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2022-11-18 20:50:13,810 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -6 predicate places. [2022-11-18 20:50:13,810 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 272 flow [2022-11-18 20:50:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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-18 20:50:13,810 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:13,810 INFO L209 CegarLoopForPetriNet]: 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, 1] [2022-11-18 20:50:13,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:50:13,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1706220828, now seen corresponding path program 1 times [2022-11-18 20:50:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:13,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300227735] [2022-11-18 20:50:13,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:13,845 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-18 20:50:13,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:13,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300227735] [2022-11-18 20:50:13,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300227735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:13,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:13,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:50:13,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520527676] [2022-11-18 20:50:13,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:13,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:13,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:13,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:13,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:13,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 128 [2022-11-18 20:50:13,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-18 20:50:13,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:13,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 128 [2022-11-18 20:50:13,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:14,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 103#L721-2true, 129#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-18 20:50:14,452 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-18 20:50:14,452 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 20:50:14,452 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-18 20:50:14,452 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-18 20:50:14,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 134#true, 129#true, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true]) [2022-11-18 20:50:14,453 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:14,453 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-18 20:50:14,453 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:14,453 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-18 20:50:14,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][116], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, 129#true, salethreadThread3of3ForFork0NotInUse, 87#L721-3true, 126#true]) [2022-11-18 20:50:14,453 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:14,454 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:14,454 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-18 20:50:14,454 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-18 20:50:14,530 INFO L130 PetriNetUnfolder]: 654/3901 cut-off events. [2022-11-18 20:50:14,530 INFO L131 PetriNetUnfolder]: For 1338/3693 co-relation queries the response was YES. [2022-11-18 20:50:14,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 3901 events. 654/3901 cut-off events. For 1338/3693 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 39293 event pairs, 115 based on Foata normal form. 1/3144 useless extension candidates. Maximal degree in co-relation 5253. Up to 474 conditions per place. [2022-11-18 20:50:14,570 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 32 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2022-11-18 20:50:14,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 409 flow [2022-11-18 20:50:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-18 20:50:14,572 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334 [2022-11-18 20:50:14,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-18 20:50:14,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-18 20:50:14,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:14,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-18 20:50:14,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-18 20:50:14,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 20:50:14,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 20:50:14,575 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 272 flow. Second operand 3 states and 317 transitions. [2022-11-18 20:50:14,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 409 flow [2022-11-18 20:50:14,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:50:14,579 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 348 flow [2022-11-18 20:50:14,579 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2022-11-18 20:50:14,581 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-11-18 20:50:14,581 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 348 flow [2022-11-18 20:50:14,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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-18 20:50:14,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:14,582 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1] [2022-11-18 20:50:14,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:50:14,582 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:14,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash 913815373, now seen corresponding path program 1 times [2022-11-18 20:50:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:14,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676239487] [2022-11-18 20:50:14,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:14,613 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-18 20:50:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:14,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676239487] [2022-11-18 20:50:14,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676239487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:14,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:14,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:50:14,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363431175] [2022-11-18 20:50:14,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:14,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:50:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:50:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:50:14,617 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 128 [2022-11-18 20:50:14,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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-18 20:50:14,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:14,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 128 [2022-11-18 20:50:14,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:16,271 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 66#salethreadENTRYtrue, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true]) [2022-11-18 20:50:16,271 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 20:50:16,271 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-18 20:50:16,271 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-18 20:50:16,271 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 20:50:16,442 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), 42#L722-1true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:16,443 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-18 20:50:16,443 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-18 20:50:16,443 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-18 20:50:16,443 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-18 20:50:16,443 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 88#L722-2true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:16,443 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-18 20:50:16,444 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-18 20:50:16,444 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-18 20:50:16,444 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-18 20:50:16,471 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 126#true, 87#L721-3true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:16,472 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:16,472 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-18 20:50:16,472 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-18 20:50:16,472 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:16,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:16,646 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:16,646 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-18 20:50:16,646 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-18 20:50:16,646 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:16,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:16,807 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-18 20:50:16,807 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 20:50:16,807 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-18 20:50:16,807 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-18 20:50:16,824 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:16,824 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-18 20:50:16,824 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 20:50:16,824 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-18 20:50:16,824 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-18 20:50:16,824 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-18 20:50:16,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 106#L722-1true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:16,825 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-18 20:50:16,825 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-18 20:50:16,825 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-18 20:50:16,825 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 20:50:17,274 INFO L130 PetriNetUnfolder]: 4573/16387 cut-off events. [2022-11-18 20:50:17,274 INFO L131 PetriNetUnfolder]: For 6386/11701 co-relation queries the response was YES. [2022-11-18 20:50:17,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27144 conditions, 16387 events. 4573/16387 cut-off events. For 6386/11701 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 201725 event pairs, 1391 based on Foata normal form. 3/13976 useless extension candidates. Maximal degree in co-relation 27135. Up to 4987 conditions per place. [2022-11-18 20:50:17,440 INFO L137 encePairwiseOnDemand]: 113/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2022-11-18 20:50:17,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 535 flow [2022-11-18 20:50:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:50:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:50:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-11-18 20:50:17,442 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2022-11-18 20:50:17,443 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-11-18 20:50:17,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-11-18 20:50:17,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:17,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-11-18 20:50:17,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-18 20:50:17,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 20:50:17,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 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-18 20:50:17,446 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 348 flow. Second operand 3 states and 314 transitions. [2022-11-18 20:50:17,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 535 flow [2022-11-18 20:50:17,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:50:17,462 INFO L231 Difference]: Finished difference. Result has 122 places, 136 transitions, 426 flow [2022-11-18 20:50:17,462 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=122, PETRI_TRANSITIONS=136} [2022-11-18 20:50:17,463 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-11-18 20:50:17,463 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 426 flow [2022-11-18 20:50:17,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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-18 20:50:17,464 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:17,464 INFO L209 CegarLoopForPetriNet]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:17,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:50:17,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash 469144953, now seen corresponding path program 1 times [2022-11-18 20:50:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:17,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025188303] [2022-11-18 20:50:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:17,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025188303] [2022-11-18 20:50:17,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025188303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:17,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351110697] [2022-11-18 20:50:17,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:17,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:17,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:17,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:17,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:50:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:17,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:50:17,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:17,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:17,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351110697] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:50:17,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:50:17,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 20:50:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058331637] [2022-11-18 20:50:17,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:17,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:50:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:50:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:50:17,752 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 128 [2022-11-18 20:50:17,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 136 transitions, 426 flow. Second operand has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 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-18 20:50:17,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:17,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 128 [2022-11-18 20:50:17,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:20,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L728-->L721-3: Formula: (= (+ v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread2of3ForFork0_#t~nondet2=|v_salethreadThread2of3ForFork0_#t~nondet2_3|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread2of3ForFork0_#t~nondet2][108], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 140#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true]) [2022-11-18 20:50:20,886 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:20,886 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:20,886 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:20,886 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:20,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][106], [Black: 140#true, 146#true, 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:20,886 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:20,886 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:20,887 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:20,887 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:20,951 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L749-6-->L752: Formula: (= |v_#race~numberOfSeatsSold~0_10| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_10|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][135], [Black: 140#true, 146#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 102#L722-2true, 56#L752true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-18 20:50:20,951 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-11-18 20:50:20,951 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-18 20:50:20,951 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-18 20:50:20,951 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-18 20:50:21,033 INFO L130 PetriNetUnfolder]: 6176/24951 cut-off events. [2022-11-18 20:50:21,034 INFO L131 PetriNetUnfolder]: For 11078/13988 co-relation queries the response was YES. [2022-11-18 20:50:21,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43873 conditions, 24951 events. 6176/24951 cut-off events. For 11078/13988 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 336576 event pairs, 1529 based on Foata normal form. 160/21065 useless extension candidates. Maximal degree in co-relation 43863. Up to 3631 conditions per place. [2022-11-18 20:50:21,230 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 73 selfloop transitions, 9 changer transitions 0/188 dead transitions. [2022-11-18 20:50:21,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 188 transitions, 804 flow [2022-11-18 20:50:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:50:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:50:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-11-18 20:50:21,233 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2022-11-18 20:50:21,233 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-11-18 20:50:21,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-11-18 20:50:21,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:21,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-11-18 20:50:21,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 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-18 20:50:21,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-18 20:50:21,239 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 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-18 20:50:21,239 INFO L175 Difference]: Start difference. First operand has 122 places, 136 transitions, 426 flow. Second operand 9 states and 888 transitions. [2022-11-18 20:50:21,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 188 transitions, 804 flow [2022-11-18 20:50:21,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 188 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:50:21,514 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 454 flow [2022-11-18 20:50:21,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2022-11-18 20:50:21,514 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2022-11-18 20:50:21,515 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 454 flow [2022-11-18 20:50:21,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 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-18 20:50:21,515 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:21,516 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:21,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:21,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:50:21,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -593229992, now seen corresponding path program 1 times [2022-11-18 20:50:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:21,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739335434] [2022-11-18 20:50:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:50:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:21,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739335434] [2022-11-18 20:50:21,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739335434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:21,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:21,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:50:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411421784] [2022-11-18 20:50:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:21,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:50:21,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:21,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:50:21,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:50:21,866 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-18 20:50:21,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 454 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-18 20:50:21,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:21,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-18 20:50:21,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:23,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, 87#L721-3true, 5#L722-2true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-18 20:50:23,561 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-18 20:50:23,561 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-18 20:50:23,561 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-18 20:50:23,561 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-18 20:50:23,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, 76#L722-1true, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-18 20:50:23,561 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-18 20:50:23,562 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 20:50:23,562 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-18 20:50:23,562 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-18 20:50:23,566 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-2-->L723: Formula: (= v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1 v_~numberOfSeatsSold~0_1) InVars {~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1} OutVars{~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1, salethreadThread3of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1} AuxVars[] AssignedVars[salethreadThread3of3ForFork0_~_numberOfSeatsSold~0][136], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, 40#L723true, salethreadThread1of3ForFork0InUse, 21#L728true, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-18 20:50:23,566 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-11-18 20:50:23,566 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-18 20:50:23,566 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-18 20:50:23,566 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-11-18 20:50:23,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, 97#L721-3true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-18 20:50:23,682 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-18 20:50:23,682 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 20:50:23,682 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-18 20:50:23,682 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 20:50:24,524 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-18 20:50:24,525 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-11-18 20:50:24,525 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:24,525 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:24,525 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:24,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][175], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 21#L728true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-18 20:50:24,674 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-18 20:50:24,674 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-18 20:50:24,674 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-18 20:50:24,674 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-18 20:50:24,727 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 134#true, 97#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-18 20:50:24,727 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:24,727 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-18 20:50:24,728 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:24,728 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:25,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true]) [2022-11-18 20:50:25,283 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-18 20:50:25,283 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-18 20:50:25,283 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-18 20:50:25,283 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-18 20:50:25,538 INFO L130 PetriNetUnfolder]: 7626/31979 cut-off events. [2022-11-18 20:50:25,539 INFO L131 PetriNetUnfolder]: For 7994/14839 co-relation queries the response was YES. [2022-11-18 20:50:25,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51791 conditions, 31979 events. 7626/31979 cut-off events. For 7994/14839 co-relation queries the response was YES. Maximal size of possible extension queue 1395. Compared 455850 event pairs, 2221 based on Foata normal form. 112/27121 useless extension candidates. Maximal degree in co-relation 51779. Up to 4756 conditions per place. [2022-11-18 20:50:25,833 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 69 selfloop transitions, 7 changer transitions 0/190 dead transitions. [2022-11-18 20:50:25,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 803 flow [2022-11-18 20:50:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:50:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:50:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-11-18 20:50:25,836 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-18 20:50:25,836 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2022-11-18 20:50:25,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2022-11-18 20:50:25,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:25,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2022-11-18 20:50:25,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 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-18 20:50:25,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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-18 20:50:25,841 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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-18 20:50:25,841 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 454 flow. Second operand 5 states and 528 transitions. [2022-11-18 20:50:25,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 190 transitions, 803 flow [2022-11-18 20:50:25,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 797 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-18 20:50:25,851 INFO L231 Difference]: Finished difference. Result has 137 places, 148 transitions, 511 flow [2022-11-18 20:50:25,851 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=137, PETRI_TRANSITIONS=148} [2022-11-18 20:50:25,852 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 14 predicate places. [2022-11-18 20:50:25,852 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 511 flow [2022-11-18 20:50:25,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-18 20:50:25,853 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:25,853 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:25,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:50:25,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1860258400, now seen corresponding path program 1 times [2022-11-18 20:50:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:25,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649166388] [2022-11-18 20:50:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:50:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:25,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649166388] [2022-11-18 20:50:25,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649166388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:25,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:50:25,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:50:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216636693] [2022-11-18 20:50:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:25,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:50:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:25,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:50:25,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:50:25,969 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-18 20:50:25,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 148 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-18 20:50:25,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:50:25,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-18 20:50:25,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:50:29,464 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), 97#L721-3true, Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-18 20:50:29,464 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-18 20:50:29,465 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-18 20:50:29,465 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:29,465 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-18 20:50:30,776 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 20), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 33#L750-7true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-18 20:50:30,776 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-18 20:50:30,776 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-18 20:50:30,776 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-18 20:50:30,776 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-18 20:50:30,881 INFO L130 PetriNetUnfolder]: 7497/33079 cut-off events. [2022-11-18 20:50:30,881 INFO L131 PetriNetUnfolder]: For 16027/21821 co-relation queries the response was YES. [2022-11-18 20:50:31,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58016 conditions, 33079 events. 7497/33079 cut-off events. For 16027/21821 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 479988 event pairs, 2293 based on Foata normal form. 208/28502 useless extension candidates. Maximal degree in co-relation 58000. Up to 4780 conditions per place. [2022-11-18 20:50:31,174 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 62 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2022-11-18 20:50:31,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 838 flow [2022-11-18 20:50:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:50:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:50:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-11-18 20:50:31,177 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8203125 [2022-11-18 20:50:31,178 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-11-18 20:50:31,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-11-18 20:50:31,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:50:31,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-11-18 20:50:31,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 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-18 20:50:31,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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-18 20:50:31,182 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 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-18 20:50:31,182 INFO L175 Difference]: Start difference. First operand has 137 places, 148 transitions, 511 flow. Second operand 5 states and 525 transitions. [2022-11-18 20:50:31,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 838 flow [2022-11-18 20:50:31,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 186 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:50:31,230 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 574 flow [2022-11-18 20:50:31,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=143, PETRI_TRANSITIONS=152} [2022-11-18 20:50:31,231 INFO L288 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places. [2022-11-18 20:50:31,232 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 574 flow [2022-11-18 20:50:31,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 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-18 20:50:31,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:50:31,232 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:50:31,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:50:31,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-18 20:50:31,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:31,233 INFO L85 PathProgramCache]: Analyzing trace with hash -871650852, now seen corresponding path program 1 times [2022-11-18 20:50:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:31,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147961221] [2022-11-18 20:50:31,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:50:31,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:50:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:50:31,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:50:31,277 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:50:31,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-11-18 20:50:31,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-18 20:50:31,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-18 20:50:31,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-18 20:50:31,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-18 20:50:31,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-18 20:50:31,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-18 20:50:31,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-18 20:50:31,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-18 20:50:31,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-18 20:50:31,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2022-11-18 20:50:31,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-11-18 20:50:31,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-11-18 20:50:31,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-18 20:50:31,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-18 20:50:31,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-18 20:50:31,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-18 20:50:31,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-18 20:50:31,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-18 20:50:31,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-18 20:50:31,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-18 20:50:31,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-18 20:50:31,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:50:31,281 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:50:31,286 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-18 20:50:31,286 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:50:31,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:50:31 BasicIcfg [2022-11-18 20:50:31,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:50:31,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:50:31,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:50:31,377 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:50:31,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:50:09" (3/4) ... [2022-11-18 20:50:31,380 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:50:31,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:50:31,382 INFO L158 Benchmark]: Toolchain (without parser) took 22603.62ms. Allocated memory was 121.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 86.6MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 783.1MB. Max. memory is 16.1GB. [2022-11-18 20:50:31,382 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:50:31,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.90ms. Allocated memory is still 121.6MB. Free memory was 86.4MB in the beginning and 87.3MB in the end (delta: -877.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:50:31,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.81ms. Allocated memory is still 121.6MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:50:31,383 INFO L158 Benchmark]: Boogie Preprocessor took 39.97ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 83.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:50:31,383 INFO L158 Benchmark]: RCFGBuilder took 552.77ms. Allocated memory is still 121.6MB. Free memory was 83.6MB in the beginning and 67.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 20:50:31,384 INFO L158 Benchmark]: TraceAbstraction took 21390.87ms. Allocated memory was 121.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 66.3MB in the beginning and 7.0GB in the end (delta: -7.0GB). Peak memory consumption was 764.8MB. Max. memory is 16.1GB. [2022-11-18 20:50:31,384 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 7.8GB. Free memory was 7.0GB in the beginning and 7.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:50:31,387 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 40.9MB in the end (delta: 39.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.90ms. Allocated memory is still 121.6MB. Free memory was 86.4MB in the beginning and 87.3MB in the end (delta: -877.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.81ms. Allocated memory is still 121.6MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.97ms. Allocated memory is still 121.6MB. Free memory was 85.2MB in the beginning and 83.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 552.77ms. Allocated memory is still 121.6MB. Free memory was 83.6MB in the beginning and 67.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21390.87ms. Allocated memory was 121.6MB in the beginning and 7.8GB in the end (delta: 7.7GB). Free memory was 66.3MB in the beginning and 7.0GB in the end (delta: -7.0GB). Peak memory consumption was 764.8MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 7.8GB. Free memory was 7.0GB in the beginning and 7.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L718] 0 int stopSales; VAL [stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, stopSales=0] [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0, numOfTickets=0, stopSales=0] [L736] 0 pthread_t salethreads[20]; VAL [\old(argc)=81, argc=81, argv={82:83}, argv={82:83}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 20 VAL [\old(argc)=81, argc=81, argv={82:83}, argv={82:83}, numberOfSeatsSold=0, numOfTickets=20, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=81, argc=81, argv={82:83}, argv={82:83}, numberOfSeatsSold=0, numOfTickets=20, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=81, argc=81, argv={82:83}, argv={82:83}, numberOfSeatsSold=0, numOfTickets=20, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=81, argc=81, argv={82:83}, argv={82:83}, i=0, numberOfSeatsSold=0, numOfTickets=20, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 20 VAL [\old(argc)=81, argc=81, argv={82:83}, argv={82:83}, i=0, numberOfSeatsSold=0, numOfTickets=20, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=81, arg={0:0}, argc=81, argv={82:83}, argv={82:83}, i=0, numberOfSeatsSold=0, numOfTickets=20, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-1, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=20, stopSales=0] [L746] 0 i++ VAL [\old(argc)=81, arg={0:0}, arg={0:0}, argc=81, argv={82:83}, argv={82:83}, i=1, numberOfSeatsSold=0, numOfTickets=20, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 20 VAL [\old(argc)=81, arg={0:0}, arg={0:0}, argc=81, argv={82:83}, argv={82:83}, i=1, numberOfSeatsSold=0, numOfTickets=20, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=81, arg={0:0}, arg={0:0}, argc=81, argv={82:83}, argv={82:83}, i=1, numberOfSeatsSold=0, numOfTickets=20, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=0, salethreads={3:0}, stopSales=0] [L721] 2 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=20, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=20, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=20, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=20, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (20 - (((20 / 10) == 0) ? 1 : (20 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=20, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=20, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=20, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 100 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 9 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 117 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 21 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 311 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 134 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 33 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-18 20:50:31,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdf86103-48bf-4ed4-9bd3-2540b8a9086c/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE