./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX --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 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:21:01,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:21:01,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:21:01,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:21:01,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:21:01,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:21:01,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:21:01,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:21:01,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:21:01,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:21:01,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:21:01,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:21:01,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:21:01,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:21:01,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:21:01,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:21:01,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:21:01,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:21:01,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:21:01,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:21:01,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:21:01,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:21:01,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:21:01,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:21:01,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:21:01,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:21:01,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:21:01,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:21:01,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:21:01,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:21:01,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:21:01,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:21:01,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:21:01,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:21:01,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:21:01,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:21:01,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:21:01,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:21:01,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:21:01,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:21:01,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:21:01,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2021-11-09 09:21:01,329 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:21:01,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:21:01,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:21:01,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:21:01,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:21:01,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:21:01,339 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:21:01,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:21:01,340 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:21:01,340 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-09 09:21:01,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:21:01,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:21:01,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:21:01,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:21:01,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:21:01,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:21:01,342 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-11-09 09:21:01,342 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:21:01,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:21:01,343 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:21:01,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:21:01,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:21:01,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:21:01,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:21:01,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:21:01,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:21:01,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:21:01,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:21:01,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:21:01,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:21:01,345 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:21:01,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:21:01,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:21:01,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:21:01,346 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_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/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_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2021-11-09 09:21:01,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:21:01,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:21:01,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:21:01,630 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:21:01,630 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:21:01,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2021-11-09 09:21:01,707 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/data/f8d5f607f/5eead6cd35aa451da793ba33bd6e6b44/FLAGeecaa11e8 [2021-11-09 09:21:02,283 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:21:02,283 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2021-11-09 09:21:02,301 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/data/f8d5f607f/5eead6cd35aa451da793ba33bd6e6b44/FLAGeecaa11e8 [2021-11-09 09:21:02,565 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/data/f8d5f607f/5eead6cd35aa451da793ba33bd6e6b44 [2021-11-09 09:21:02,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:21:02,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:21:02,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:21:02,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:21:02,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:21:02,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:21:02" (1/1) ... [2021-11-09 09:21:02,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@629ebccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:02, skipping insertion in model container [2021-11-09 09:21:02,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:21:02" (1/1) ... [2021-11-09 09:21:02,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:21:02,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:21:03,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:21:03,428 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:21:03,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:21:03,573 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:21:03,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03 WrapperNode [2021-11-09 09:21:03,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:21:03,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:21:03,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:21:03,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:21:03,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:21:03,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:21:03,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:21:03,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:21:03,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:21:03,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:21:03,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:21:03,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:21:03,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (1/1) ... [2021-11-09 09:21:03,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:21:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:21:03,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:21:03,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:21:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:21:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-09 09:21:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 09:21:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 09:21:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 09:21:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-09 09:21:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 09:21:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-09 09:21:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-11-09 09:21:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-11-09 09:21:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:21:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:21:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:21:03,883 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-09 09:21:04,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:21:04,676 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-09 09:21:04,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:21:04 BoogieIcfgContainer [2021-11-09 09:21:04,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:21:04,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:21:04,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:21:04,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:21:04,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:21:02" (1/3) ... [2021-11-09 09:21:04,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49707c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:21:04, skipping insertion in model container [2021-11-09 09:21:04,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:21:03" (2/3) ... [2021-11-09 09:21:04,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49707c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:21:04, skipping insertion in model container [2021-11-09 09:21:04,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:21:04" (3/3) ... [2021-11-09 09:21:04,688 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2021-11-09 09:21:04,693 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-09 09:21:04,693 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:21:04,694 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-11-09 09:21:04,694 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-09 09:21:04,735 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,736 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,736 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,737 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,737 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,759 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,760 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,770 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,770 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,770 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,770 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,770 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,773 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,774 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,775 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,776 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,777 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,778 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,779 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,780 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,780 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,782 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,783 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,783 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,784 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,785 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,785 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,786 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-09 09:21:04,790 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-09 09:21:04,838 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:21:04,844 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:21:04,845 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-11-09 09:21:04,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 278 places, 274 transitions, 553 flow [2021-11-09 09:21:05,000 INFO L129 PetriNetUnfolder]: 0/273 cut-off events. [2021-11-09 09:21:05,000 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:21:05,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 273 events. 0/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 153 event pairs, 0 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-11-09 09:21:05,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 274 transitions, 553 flow [2021-11-09 09:21:05,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 273 transitions, 549 flow [2021-11-09 09:21:05,020 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2021-11-09 09:21:05,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:21:05,021 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:05,021 INFO L254 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, 1] [2021-11-09 09:21:05,022 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:05,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1089797391, now seen corresponding path program 1 times [2021-11-09 09:21:05,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:05,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545812101] [2021-11-09 09:21:05,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:05,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:05,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:05,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545812101] [2021-11-09 09:21:05,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545812101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:05,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:05,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:05,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240509654] [2021-11-09 09:21:05,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:05,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:05,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:05,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:05,469 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 274 [2021-11-09 09:21:05,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 273 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:05,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:05,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 274 [2021-11-09 09:21:05,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:06,582 INFO L129 PetriNetUnfolder]: 864/2808 cut-off events. [2021-11-09 09:21:06,583 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:21:06,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4664 conditions, 2808 events. 864/2808 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 17542 event pairs, 864 based on Foata normal form. 0/2447 useless extension candidates. Maximal degree in co-relation 4450. Up to 1837 conditions per place. [2021-11-09 09:21:06,618 INFO L132 encePairwiseOnDemand]: 256/274 looper letters, 108 selfloop transitions, 15 changer transitions 0/270 dead transitions. [2021-11-09 09:21:06,618 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 270 transitions, 789 flow [2021-11-09 09:21:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1014 transitions. [2021-11-09 09:21:06,644 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6167883211678832 [2021-11-09 09:21:06,645 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1014 transitions. [2021-11-09 09:21:06,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1014 transitions. [2021-11-09 09:21:06,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:06,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1014 transitions. [2021-11-09 09:21:06,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:06,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:06,675 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:06,677 INFO L186 Difference]: Start difference. First operand has 277 places, 273 transitions, 549 flow. Second operand 6 states and 1014 transitions. [2021-11-09 09:21:06,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 270 transitions, 789 flow [2021-11-09 09:21:06,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 270 transitions, 788 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-09 09:21:06,746 INFO L242 Difference]: Finished difference. Result has 278 places, 270 transitions, 572 flow [2021-11-09 09:21:06,748 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=278, PETRI_TRANSITIONS=270} [2021-11-09 09:21:06,749 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 1 predicate places. [2021-11-09 09:21:06,749 INFO L470 AbstractCegarLoop]: Abstraction has has 278 places, 270 transitions, 572 flow [2021-11-09 09:21:06,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:06,751 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:06,751 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:06,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:21:06,751 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash -304741632, now seen corresponding path program 1 times [2021-11-09 09:21:06,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:06,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295042826] [2021-11-09 09:21:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:06,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:07,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:07,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295042826] [2021-11-09 09:21:07,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295042826] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:07,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:07,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:07,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752696260] [2021-11-09 09:21:07,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:07,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:07,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:07,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 274 [2021-11-09 09:21:07,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 270 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:07,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:07,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 274 [2021-11-09 09:21:07,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:07,976 INFO L129 PetriNetUnfolder]: 864/2805 cut-off events. [2021-11-09 09:21:07,976 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-09 09:21:07,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4673 conditions, 2805 events. 864/2805 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 17594 event pairs, 864 based on Foata normal form. 0/2447 useless extension candidates. Maximal degree in co-relation 4490. Up to 1834 conditions per place. [2021-11-09 09:21:08,000 INFO L132 encePairwiseOnDemand]: 256/274 looper letters, 105 selfloop transitions, 15 changer transitions 0/267 dead transitions. [2021-11-09 09:21:08,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 267 transitions, 806 flow [2021-11-09 09:21:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1011 transitions. [2021-11-09 09:21:08,026 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.614963503649635 [2021-11-09 09:21:08,026 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1011 transitions. [2021-11-09 09:21:08,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1011 transitions. [2021-11-09 09:21:08,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:08,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1011 transitions. [2021-11-09 09:21:08,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.5) internal successors, (1011), 6 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,039 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,039 INFO L186 Difference]: Start difference. First operand has 278 places, 270 transitions, 572 flow. Second operand 6 states and 1011 transitions. [2021-11-09 09:21:08,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 267 transitions, 806 flow [2021-11-09 09:21:08,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 267 transitions, 776 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-09 09:21:08,057 INFO L242 Difference]: Finished difference. Result has 275 places, 267 transitions, 566 flow [2021-11-09 09:21:08,058 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=566, PETRI_PLACES=275, PETRI_TRANSITIONS=267} [2021-11-09 09:21:08,058 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -2 predicate places. [2021-11-09 09:21:08,059 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 267 transitions, 566 flow [2021-11-09 09:21:08,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,060 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:08,060 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:08,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:21:08,061 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:08,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash -324038064, now seen corresponding path program 1 times [2021-11-09 09:21:08,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:08,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16962353] [2021-11-09 09:21:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:08,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:08,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:08,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16962353] [2021-11-09 09:21:08,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16962353] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:08,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:08,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:21:08,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522568497] [2021-11-09 09:21:08,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:21:08,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:08,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:21:08,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:21:08,175 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 274 [2021-11-09 09:21:08,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 267 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:08,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 274 [2021-11-09 09:21:08,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:08,284 INFO L129 PetriNetUnfolder]: 9/491 cut-off events. [2021-11-09 09:21:08,284 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:21:08,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 491 events. 9/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1481 event pairs, 9 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 391. Up to 34 conditions per place. [2021-11-09 09:21:08,287 INFO L132 encePairwiseOnDemand]: 271/274 looper letters, 15 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2021-11-09 09:21:08,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 266 transitions, 598 flow [2021-11-09 09:21:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:21:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-09 09:21:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2021-11-09 09:21:08,291 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9562043795620438 [2021-11-09 09:21:08,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 786 transitions. [2021-11-09 09:21:08,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 786 transitions. [2021-11-09 09:21:08,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:08,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 786 transitions. [2021-11-09 09:21:08,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,300 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,300 INFO L186 Difference]: Start difference. First operand has 275 places, 267 transitions, 566 flow. Second operand 3 states and 786 transitions. [2021-11-09 09:21:08,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 266 transitions, 598 flow [2021-11-09 09:21:08,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 266 transitions, 568 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-09 09:21:08,355 INFO L242 Difference]: Finished difference. Result has 271 places, 266 transitions, 538 flow [2021-11-09 09:21:08,356 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=271, PETRI_TRANSITIONS=266} [2021-11-09 09:21:08,356 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -6 predicate places. [2021-11-09 09:21:08,356 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 266 transitions, 538 flow [2021-11-09 09:21:08,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,357 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:08,357 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:08,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 09:21:08,358 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 201932751, now seen corresponding path program 1 times [2021-11-09 09:21:08,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:08,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694941580] [2021-11-09 09:21:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:08,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:08,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:08,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694941580] [2021-11-09 09:21:08,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694941580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:08,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:08,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:21:08,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075190123] [2021-11-09 09:21:08,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:21:08,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:08,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:21:08,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:21:08,445 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 274 [2021-11-09 09:21:08,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 266 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:08,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 274 [2021-11-09 09:21:08,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:08,522 INFO L129 PetriNetUnfolder]: 4/429 cut-off events. [2021-11-09 09:21:08,522 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-09 09:21:08,523 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 429 events. 4/429 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1070 event pairs, 4 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 387. Up to 16 conditions per place. [2021-11-09 09:21:08,525 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 9 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2021-11-09 09:21:08,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 262 transitions, 550 flow [2021-11-09 09:21:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:21:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-09 09:21:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2021-11-09 09:21:08,528 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.962287104622871 [2021-11-09 09:21:08,528 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2021-11-09 09:21:08,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2021-11-09 09:21:08,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:08,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2021-11-09 09:21:08,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,536 INFO L186 Difference]: Start difference. First operand has 271 places, 266 transitions, 538 flow. Second operand 3 states and 791 transitions. [2021-11-09 09:21:08,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 262 transitions, 550 flow [2021-11-09 09:21:08,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 262 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-09 09:21:08,543 INFO L242 Difference]: Finished difference. Result has 267 places, 262 transitions, 528 flow [2021-11-09 09:21:08,544 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=267, PETRI_TRANSITIONS=262} [2021-11-09 09:21:08,545 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -10 predicate places. [2021-11-09 09:21:08,545 INFO L470 AbstractCegarLoop]: Abstraction has has 267 places, 262 transitions, 528 flow [2021-11-09 09:21:08,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,546 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:08,546 INFO L254 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, 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, 1, 1] [2021-11-09 09:21:08,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 09:21:08,547 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash -59278229, now seen corresponding path program 1 times [2021-11-09 09:21:08,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:08,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431960276] [2021-11-09 09:21:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:08,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:08,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:08,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431960276] [2021-11-09 09:21:08,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431960276] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:08,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:08,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:08,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277011576] [2021-11-09 09:21:08,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:08,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:08,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:08,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:08,752 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 274 [2021-11-09 09:21:08,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 262 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:08,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:08,754 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 274 [2021-11-09 09:21:08,754 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:09,565 INFO L129 PetriNetUnfolder]: 925/2970 cut-off events. [2021-11-09 09:21:09,565 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:21:09,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4936 conditions, 2970 events. 925/2970 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 18676 event pairs, 925 based on Foata normal form. 0/2606 useless extension candidates. Maximal degree in co-relation 4858. Up to 1956 conditions per place. [2021-11-09 09:21:09,589 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 105 selfloop transitions, 5 changer transitions 0/261 dead transitions. [2021-11-09 09:21:09,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 261 transitions, 746 flow [2021-11-09 09:21:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1053 transitions. [2021-11-09 09:21:09,594 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6405109489051095 [2021-11-09 09:21:09,595 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1053 transitions. [2021-11-09 09:21:09,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1053 transitions. [2021-11-09 09:21:09,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:09,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1053 transitions. [2021-11-09 09:21:09,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,604 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,605 INFO L186 Difference]: Start difference. First operand has 267 places, 262 transitions, 528 flow. Second operand 6 states and 1053 transitions. [2021-11-09 09:21:09,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 261 transitions, 746 flow [2021-11-09 09:21:09,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 261 transitions, 745 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-09 09:21:09,612 INFO L242 Difference]: Finished difference. Result has 270 places, 261 transitions, 535 flow [2021-11-09 09:21:09,613 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=270, PETRI_TRANSITIONS=261} [2021-11-09 09:21:09,614 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -7 predicate places. [2021-11-09 09:21:09,614 INFO L470 AbstractCegarLoop]: Abstraction has has 270 places, 261 transitions, 535 flow [2021-11-09 09:21:09,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,615 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:09,615 INFO L254 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:09,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 09:21:09,615 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:09,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:09,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1867026332, now seen corresponding path program 1 times [2021-11-09 09:21:09,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:09,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392841724] [2021-11-09 09:21:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:09,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:09,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:09,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392841724] [2021-11-09 09:21:09,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392841724] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:09,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:09,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:21:09,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676704346] [2021-11-09 09:21:09,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:21:09,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:21:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:21:09,690 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 274 [2021-11-09 09:21:09,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 261 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:09,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 274 [2021-11-09 09:21:09,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:09,784 INFO L129 PetriNetUnfolder]: 9/392 cut-off events. [2021-11-09 09:21:09,785 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:21:09,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 392 events. 9/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 772 event pairs, 9 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 372. Up to 34 conditions per place. [2021-11-09 09:21:09,787 INFO L132 encePairwiseOnDemand]: 271/274 looper letters, 15 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2021-11-09 09:21:09,788 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 260 transitions, 567 flow [2021-11-09 09:21:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:21:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-09 09:21:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2021-11-09 09:21:09,791 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9562043795620438 [2021-11-09 09:21:09,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 786 transitions. [2021-11-09 09:21:09,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 786 transitions. [2021-11-09 09:21:09,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:09,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 786 transitions. [2021-11-09 09:21:09,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,799 INFO L186 Difference]: Start difference. First operand has 270 places, 261 transitions, 535 flow. Second operand 3 states and 786 transitions. [2021-11-09 09:21:09,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 260 transitions, 567 flow [2021-11-09 09:21:09,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 260 transitions, 557 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-09 09:21:09,807 INFO L242 Difference]: Finished difference. Result has 266 places, 260 transitions, 527 flow [2021-11-09 09:21:09,808 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=266, PETRI_TRANSITIONS=260} [2021-11-09 09:21:09,808 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -11 predicate places. [2021-11-09 09:21:09,808 INFO L470 AbstractCegarLoop]: Abstraction has has 266 places, 260 transitions, 527 flow [2021-11-09 09:21:09,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:09,810 INFO L254 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:09,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 09:21:09,811 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:09,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1943484596, now seen corresponding path program 1 times [2021-11-09 09:21:09,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:09,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917870805] [2021-11-09 09:21:09,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:09,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:09,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:09,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917870805] [2021-11-09 09:21:09,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917870805] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:09,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:09,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:21:09,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082787221] [2021-11-09 09:21:09,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:21:09,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:09,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:21:09,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:21:09,912 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 274 [2021-11-09 09:21:09,913 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 260 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:09,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 274 [2021-11-09 09:21:09,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:09,986 INFO L129 PetriNetUnfolder]: 4/348 cut-off events. [2021-11-09 09:21:09,986 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-09 09:21:09,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 348 events. 4/348 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 515 event pairs, 4 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 309. Up to 16 conditions per place. [2021-11-09 09:21:09,989 INFO L132 encePairwiseOnDemand]: 269/274 looper letters, 9 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2021-11-09 09:21:09,989 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 256 transitions, 539 flow [2021-11-09 09:21:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:21:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-09 09:21:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2021-11-09 09:21:09,993 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.962287104622871 [2021-11-09 09:21:09,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2021-11-09 09:21:09,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2021-11-09 09:21:09,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:09,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2021-11-09 09:21:09,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:09,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,000 INFO L186 Difference]: Start difference. First operand has 266 places, 260 transitions, 527 flow. Second operand 3 states and 791 transitions. [2021-11-09 09:21:10,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 256 transitions, 539 flow [2021-11-09 09:21:10,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 256 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-09 09:21:10,008 INFO L242 Difference]: Finished difference. Result has 262 places, 256 transitions, 517 flow [2021-11-09 09:21:10,008 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=262, PETRI_TRANSITIONS=256} [2021-11-09 09:21:10,009 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -15 predicate places. [2021-11-09 09:21:10,009 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 256 transitions, 517 flow [2021-11-09 09:21:10,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,010 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:10,010 INFO L254 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, 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, 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] [2021-11-09 09:21:10,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 09:21:10,011 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash 821991730, now seen corresponding path program 1 times [2021-11-09 09:21:10,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:10,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816928965] [2021-11-09 09:21:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:10,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:10,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:10,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816928965] [2021-11-09 09:21:10,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816928965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:10,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:10,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:10,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87985444] [2021-11-09 09:21:10,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:10,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:10,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:10,183 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 274 [2021-11-09 09:21:10,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 256 transitions, 517 flow. Second operand has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:10,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 274 [2021-11-09 09:21:10,186 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:10,950 INFO L129 PetriNetUnfolder]: 925/2881 cut-off events. [2021-11-09 09:21:10,950 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-09 09:21:10,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 2881 events. 925/2881 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 17908 event pairs, 925 based on Foata normal form. 0/2551 useless extension candidates. Maximal degree in co-relation 4770. Up to 1955 conditions per place. [2021-11-09 09:21:10,971 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 104 selfloop transitions, 5 changer transitions 0/255 dead transitions. [2021-11-09 09:21:10,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 255 transitions, 733 flow [2021-11-09 09:21:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1052 transitions. [2021-11-09 09:21:10,975 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6399026763990268 [2021-11-09 09:21:10,975 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1052 transitions. [2021-11-09 09:21:10,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1052 transitions. [2021-11-09 09:21:10,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:10,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1052 transitions. [2021-11-09 09:21:10,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.33333333333334) internal successors, (1052), 6 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,985 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,985 INFO L186 Difference]: Start difference. First operand has 262 places, 256 transitions, 517 flow. Second operand 6 states and 1052 transitions. [2021-11-09 09:21:10,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 255 transitions, 733 flow [2021-11-09 09:21:10,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 255 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-09 09:21:10,992 INFO L242 Difference]: Finished difference. Result has 265 places, 255 transitions, 524 flow [2021-11-09 09:21:10,993 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=265, PETRI_TRANSITIONS=255} [2021-11-09 09:21:10,993 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -12 predicate places. [2021-11-09 09:21:10,993 INFO L470 AbstractCegarLoop]: Abstraction has has 265 places, 255 transitions, 524 flow [2021-11-09 09:21:10,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:10,994 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:10,994 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:10,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 09:21:10,995 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1948175202, now seen corresponding path program 1 times [2021-11-09 09:21:10,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:10,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714053112] [2021-11-09 09:21:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:10,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:11,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:11,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714053112] [2021-11-09 09:21:11,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714053112] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:11,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:11,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:11,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212420669] [2021-11-09 09:21:11,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:11,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:11,144 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 274 [2021-11-09 09:21:11,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 255 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:11,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:11,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 274 [2021-11-09 09:21:11,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:12,572 INFO L129 PetriNetUnfolder]: 1392/4408 cut-off events. [2021-11-09 09:21:12,572 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-11-09 09:21:12,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7356 conditions, 4408 events. 1392/4408 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 32063 event pairs, 181 based on Foata normal form. 0/3962 useless extension candidates. Maximal degree in co-relation 7279. Up to 1396 conditions per place. [2021-11-09 09:21:12,606 INFO L132 encePairwiseOnDemand]: 255/274 looper letters, 209 selfloop transitions, 38 changer transitions 0/396 dead transitions. [2021-11-09 09:21:12,607 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 396 transitions, 1300 flow [2021-11-09 09:21:12,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1209 transitions. [2021-11-09 09:21:12,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7354014598540146 [2021-11-09 09:21:12,612 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1209 transitions. [2021-11-09 09:21:12,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1209 transitions. [2021-11-09 09:21:12,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:12,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1209 transitions. [2021-11-09 09:21:12,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:12,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:12,622 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:12,622 INFO L186 Difference]: Start difference. First operand has 265 places, 255 transitions, 524 flow. Second operand 6 states and 1209 transitions. [2021-11-09 09:21:12,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 396 transitions, 1300 flow [2021-11-09 09:21:12,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 396 transitions, 1290 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-09 09:21:12,632 INFO L242 Difference]: Finished difference. Result has 269 places, 291 transitions, 772 flow [2021-11-09 09:21:12,633 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=269, PETRI_TRANSITIONS=291} [2021-11-09 09:21:12,633 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -8 predicate places. [2021-11-09 09:21:12,633 INFO L470 AbstractCegarLoop]: Abstraction has has 269 places, 291 transitions, 772 flow [2021-11-09 09:21:12,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:12,634 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:12,634 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:12,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 09:21:12,635 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash -524680990, now seen corresponding path program 1 times [2021-11-09 09:21:12,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:12,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231391164] [2021-11-09 09:21:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:12,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:12,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:12,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231391164] [2021-11-09 09:21:12,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231391164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:12,773 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:12,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:12,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318856410] [2021-11-09 09:21:12,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:12,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:12,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:12,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:12,776 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 274 [2021-11-09 09:21:12,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 291 transitions, 772 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:12,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:12,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 274 [2021-11-09 09:21:12,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:13,783 INFO L129 PetriNetUnfolder]: 1425/4505 cut-off events. [2021-11-09 09:21:13,783 INFO L130 PetriNetUnfolder]: For 1052/1055 co-relation queries the response was YES. [2021-11-09 09:21:13,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8627 conditions, 4505 events. 1425/4505 cut-off events. For 1052/1055 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 32403 event pairs, 936 based on Foata normal form. 0/4058 useless extension candidates. Maximal degree in co-relation 8548. Up to 2720 conditions per place. [2021-11-09 09:21:13,815 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 227 selfloop transitions, 5 changer transitions 0/382 dead transitions. [2021-11-09 09:21:13,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 382 transitions, 1458 flow [2021-11-09 09:21:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1162 transitions. [2021-11-09 09:21:13,822 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7068126520681265 [2021-11-09 09:21:13,822 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1162 transitions. [2021-11-09 09:21:13,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1162 transitions. [2021-11-09 09:21:13,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:13,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1162 transitions. [2021-11-09 09:21:13,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.66666666666666) internal successors, (1162), 6 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:13,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:13,832 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:13,832 INFO L186 Difference]: Start difference. First operand has 269 places, 291 transitions, 772 flow. Second operand 6 states and 1162 transitions. [2021-11-09 09:21:13,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 382 transitions, 1458 flow [2021-11-09 09:21:13,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 382 transitions, 1458 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 09:21:13,856 INFO L242 Difference]: Finished difference. Result has 273 places, 290 transitions, 780 flow [2021-11-09 09:21:13,858 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=273, PETRI_TRANSITIONS=290} [2021-11-09 09:21:13,858 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, -4 predicate places. [2021-11-09 09:21:13,859 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 290 transitions, 780 flow [2021-11-09 09:21:13,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:13,860 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:13,860 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:13,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 09:21:13,865 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1113979547, now seen corresponding path program 1 times [2021-11-09 09:21:13,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:13,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623243912] [2021-11-09 09:21:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:13,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:14,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:14,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623243912] [2021-11-09 09:21:14,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623243912] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:14,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:14,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:14,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677451902] [2021-11-09 09:21:14,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:14,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:14,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:14,037 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 274 [2021-11-09 09:21:14,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 290 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:14,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:14,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 274 [2021-11-09 09:21:14,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:15,627 INFO L129 PetriNetUnfolder]: 1814/5596 cut-off events. [2021-11-09 09:21:15,627 INFO L130 PetriNetUnfolder]: For 1343/1349 co-relation queries the response was YES. [2021-11-09 09:21:15,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10818 conditions, 5596 events. 1814/5596 cut-off events. For 1343/1349 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 43096 event pairs, 351 based on Foata normal form. 0/5148 useless extension candidates. Maximal degree in co-relation 10735. Up to 2161 conditions per place. [2021-11-09 09:21:15,670 INFO L132 encePairwiseOnDemand]: 253/274 looper letters, 252 selfloop transitions, 71 changer transitions 0/469 dead transitions. [2021-11-09 09:21:15,671 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 469 transitions, 2040 flow [2021-11-09 09:21:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1202 transitions. [2021-11-09 09:21:15,676 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7311435523114356 [2021-11-09 09:21:15,676 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1202 transitions. [2021-11-09 09:21:15,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1202 transitions. [2021-11-09 09:21:15,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:15,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1202 transitions. [2021-11-09 09:21:15,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 200.33333333333334) internal successors, (1202), 6 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:15,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:15,687 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:15,687 INFO L186 Difference]: Start difference. First operand has 273 places, 290 transitions, 780 flow. Second operand 6 states and 1202 transitions. [2021-11-09 09:21:15,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 469 transitions, 2040 flow [2021-11-09 09:21:15,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 469 transitions, 1990 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-09 09:21:15,703 INFO L242 Difference]: Finished difference. Result has 278 places, 359 transitions, 1428 flow [2021-11-09 09:21:15,704 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1428, PETRI_PLACES=278, PETRI_TRANSITIONS=359} [2021-11-09 09:21:15,704 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 1 predicate places. [2021-11-09 09:21:15,704 INFO L470 AbstractCegarLoop]: Abstraction has has 278 places, 359 transitions, 1428 flow [2021-11-09 09:21:15,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:15,705 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:15,705 INFO L254 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:15,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 09:21:15,706 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:15,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash -679242905, now seen corresponding path program 1 times [2021-11-09 09:21:15,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:15,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895260213] [2021-11-09 09:21:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:15,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:15,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:15,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895260213] [2021-11-09 09:21:15,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895260213] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:15,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:15,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:15,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388672789] [2021-11-09 09:21:15,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:15,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:15,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:15,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:15,892 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 274 [2021-11-09 09:21:15,894 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 359 transitions, 1428 flow. Second operand has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:15,894 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:15,894 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 274 [2021-11-09 09:21:15,894 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:17,669 INFO L129 PetriNetUnfolder]: 1933/6059 cut-off events. [2021-11-09 09:21:17,670 INFO L130 PetriNetUnfolder]: For 3595/3645 co-relation queries the response was YES. [2021-11-09 09:21:17,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13983 conditions, 6059 events. 1933/6059 cut-off events. For 3595/3645 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 47343 event pairs, 1000 based on Foata normal form. 0/5646 useless extension candidates. Maximal degree in co-relation 13899. Up to 3830 conditions per place. [2021-11-09 09:21:17,714 INFO L132 encePairwiseOnDemand]: 251/274 looper letters, 240 selfloop transitions, 89 changer transitions 0/478 dead transitions. [2021-11-09 09:21:17,714 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 478 transitions, 2606 flow [2021-11-09 09:21:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1161 transitions. [2021-11-09 09:21:17,719 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7062043795620438 [2021-11-09 09:21:17,719 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1161 transitions. [2021-11-09 09:21:17,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1161 transitions. [2021-11-09 09:21:17,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:17,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1161 transitions. [2021-11-09 09:21:17,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:17,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:17,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:17,729 INFO L186 Difference]: Start difference. First operand has 278 places, 359 transitions, 1428 flow. Second operand 6 states and 1161 transitions. [2021-11-09 09:21:17,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 478 transitions, 2606 flow [2021-11-09 09:21:17,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 478 transitions, 2606 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-09 09:21:17,752 INFO L242 Difference]: Finished difference. Result has 288 places, 443 transitions, 2230 flow [2021-11-09 09:21:17,753 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2230, PETRI_PLACES=288, PETRI_TRANSITIONS=443} [2021-11-09 09:21:17,753 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 11 predicate places. [2021-11-09 09:21:17,753 INFO L470 AbstractCegarLoop]: Abstraction has has 288 places, 443 transitions, 2230 flow [2021-11-09 09:21:17,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:17,755 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:17,755 INFO L254 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, 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, 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, 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] [2021-11-09 09:21:17,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 09:21:17,755 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1805383735, now seen corresponding path program 1 times [2021-11-09 09:21:17,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:17,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436843875] [2021-11-09 09:21:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:17,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:17,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:17,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436843875] [2021-11-09 09:21:17,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436843875] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:17,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:17,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:21:17,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312668748] [2021-11-09 09:21:17,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:21:17,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:17,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:21:17,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:21:17,824 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 274 [2021-11-09 09:21:17,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 443 transitions, 2230 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:17,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:17,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 274 [2021-11-09 09:21:17,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:18,196 INFO L129 PetriNetUnfolder]: 277/1869 cut-off events. [2021-11-09 09:21:18,196 INFO L130 PetriNetUnfolder]: For 1212/1288 co-relation queries the response was YES. [2021-11-09 09:21:18,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 1869 events. 277/1869 cut-off events. For 1212/1288 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12800 event pairs, 25 based on Foata normal form. 4/1793 useless extension candidates. Maximal degree in co-relation 3776. Up to 272 conditions per place. [2021-11-09 09:21:18,213 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 14 selfloop transitions, 6 changer transitions 0/383 dead transitions. [2021-11-09 09:21:18,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 383 transitions, 1706 flow [2021-11-09 09:21:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:21:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-11-09 09:21:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2021-11-09 09:21:18,217 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.975669099756691 [2021-11-09 09:21:18,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2021-11-09 09:21:18,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2021-11-09 09:21:18,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:18,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2021-11-09 09:21:18,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:18,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:18,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:18,223 INFO L186 Difference]: Start difference. First operand has 288 places, 443 transitions, 2230 flow. Second operand 3 states and 802 transitions. [2021-11-09 09:21:18,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 383 transitions, 1706 flow [2021-11-09 09:21:18,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 383 transitions, 1618 flow, removed 44 selfloop flow, removed 0 redundant places. [2021-11-09 09:21:18,246 INFO L242 Difference]: Finished difference. Result has 291 places, 381 transitions, 1600 flow [2021-11-09 09:21:18,247 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1600, PETRI_PLACES=291, PETRI_TRANSITIONS=381} [2021-11-09 09:21:18,247 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 14 predicate places. [2021-11-09 09:21:18,248 INFO L470 AbstractCegarLoop]: Abstraction has has 291 places, 381 transitions, 1600 flow [2021-11-09 09:21:18,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:18,248 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:18,248 INFO L254 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, 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, 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, 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] [2021-11-09 09:21:18,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 09:21:18,249 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2076598875, now seen corresponding path program 1 times [2021-11-09 09:21:18,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:18,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321177025] [2021-11-09 09:21:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:18,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:18,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:18,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321177025] [2021-11-09 09:21:18,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321177025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:18,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:18,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:18,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080704746] [2021-11-09 09:21:18,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:18,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:18,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:18,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:18,419 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 274 [2021-11-09 09:21:18,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 381 transitions, 1600 flow. Second operand has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:18,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:18,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 274 [2021-11-09 09:21:18,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:20,168 INFO L129 PetriNetUnfolder]: 1230/4221 cut-off events. [2021-11-09 09:21:20,168 INFO L130 PetriNetUnfolder]: For 3299/3328 co-relation queries the response was YES. [2021-11-09 09:21:20,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10787 conditions, 4221 events. 1230/4221 cut-off events. For 3299/3328 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 32302 event pairs, 209 based on Foata normal form. 0/4047 useless extension candidates. Maximal degree in co-relation 10695. Up to 1158 conditions per place. [2021-11-09 09:21:20,203 INFO L132 encePairwiseOnDemand]: 255/274 looper letters, 375 selfloop transitions, 124 changer transitions 4/657 dead transitions. [2021-11-09 09:21:20,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 657 transitions, 4172 flow [2021-11-09 09:21:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1254 transitions. [2021-11-09 09:21:20,209 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7627737226277372 [2021-11-09 09:21:20,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1254 transitions. [2021-11-09 09:21:20,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1254 transitions. [2021-11-09 09:21:20,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:20,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1254 transitions. [2021-11-09 09:21:20,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:20,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:20,219 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:20,220 INFO L186 Difference]: Start difference. First operand has 291 places, 381 transitions, 1600 flow. Second operand 6 states and 1254 transitions. [2021-11-09 09:21:20,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 657 transitions, 4172 flow [2021-11-09 09:21:20,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 657 transitions, 4166 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-11-09 09:21:20,255 INFO L242 Difference]: Finished difference. Result has 299 places, 483 transitions, 2976 flow [2021-11-09 09:21:20,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2976, PETRI_PLACES=299, PETRI_TRANSITIONS=483} [2021-11-09 09:21:20,257 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 22 predicate places. [2021-11-09 09:21:20,257 INFO L470 AbstractCegarLoop]: Abstraction has has 299 places, 483 transitions, 2976 flow [2021-11-09 09:21:20,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:20,258 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:20,258 INFO L254 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, 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, 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, 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] [2021-11-09 09:21:20,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 09:21:20,258 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -446887160, now seen corresponding path program 1 times [2021-11-09 09:21:20,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:20,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707130323] [2021-11-09 09:21:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:20,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:20,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:20,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707130323] [2021-11-09 09:21:20,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707130323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:20,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:20,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:20,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570441240] [2021-11-09 09:21:20,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:20,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:20,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:20,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:20,400 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 274 [2021-11-09 09:21:20,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 483 transitions, 2976 flow. Second operand has 6 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:20,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:20,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 274 [2021-11-09 09:21:20,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:21,845 INFO L129 PetriNetUnfolder]: 1281/4292 cut-off events. [2021-11-09 09:21:21,845 INFO L130 PetriNetUnfolder]: For 6060/6100 co-relation queries the response was YES. [2021-11-09 09:21:21,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12570 conditions, 4292 events. 1281/4292 cut-off events. For 6060/6100 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 32591 event pairs, 469 based on Foata normal form. 0/4164 useless extension candidates. Maximal degree in co-relation 12475. Up to 2346 conditions per place. [2021-11-09 09:21:21,882 INFO L132 encePairwiseOnDemand]: 268/274 looper letters, 410 selfloop transitions, 17 changer transitions 0/582 dead transitions. [2021-11-09 09:21:21,883 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 582 transitions, 4420 flow [2021-11-09 09:21:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:21:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:21:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1152 transitions. [2021-11-09 09:21:21,888 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7007299270072993 [2021-11-09 09:21:21,888 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1152 transitions. [2021-11-09 09:21:21,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1152 transitions. [2021-11-09 09:21:21,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:21,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1152 transitions. [2021-11-09 09:21:21,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:21,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:21,897 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:21,897 INFO L186 Difference]: Start difference. First operand has 299 places, 483 transitions, 2976 flow. Second operand 6 states and 1152 transitions. [2021-11-09 09:21:21,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 582 transitions, 4420 flow [2021-11-09 09:21:21,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 582 transitions, 4402 flow, removed 9 selfloop flow, removed 0 redundant places. [2021-11-09 09:21:21,938 INFO L242 Difference]: Finished difference. Result has 303 places, 482 transitions, 2990 flow [2021-11-09 09:21:21,939 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2956, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2990, PETRI_PLACES=303, PETRI_TRANSITIONS=482} [2021-11-09 09:21:21,939 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 26 predicate places. [2021-11-09 09:21:21,939 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 482 transitions, 2990 flow [2021-11-09 09:21:21,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.33333333333334) internal successors, (1034), 6 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:21,940 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:21,940 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:21,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 09:21:21,940 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 274879981, now seen corresponding path program 1 times [2021-11-09 09:21:21,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:21,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121583594] [2021-11-09 09:21:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:21,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:22,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:22,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121583594] [2021-11-09 09:21:22,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121583594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:22,591 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:22,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-09 09:21:22,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364793583] [2021-11-09 09:21:22,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-09 09:21:22,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:22,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-09 09:21:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:21:22,596 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 274 [2021-11-09 09:21:22,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 482 transitions, 2990 flow. Second operand has 20 states, 20 states have (on average 117.6) internal successors, (2352), 20 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:22,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:22,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 274 [2021-11-09 09:21:22,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:25,303 INFO L129 PetriNetUnfolder]: 1779/5323 cut-off events. [2021-11-09 09:21:25,304 INFO L130 PetriNetUnfolder]: For 6985/6985 co-relation queries the response was YES. [2021-11-09 09:21:25,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15739 conditions, 5323 events. 1779/5323 cut-off events. For 6985/6985 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 40694 event pairs, 262 based on Foata normal form. 15/5204 useless extension candidates. Maximal degree in co-relation 15622. Up to 2235 conditions per place. [2021-11-09 09:21:25,346 INFO L132 encePairwiseOnDemand]: 245/274 looper letters, 524 selfloop transitions, 108 changer transitions 1/737 dead transitions. [2021-11-09 09:21:25,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 737 transitions, 5672 flow [2021-11-09 09:21:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-09 09:21:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-11-09 09:21:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 4524 transitions. [2021-11-09 09:21:25,367 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4462418623002565 [2021-11-09 09:21:25,367 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 4524 transitions. [2021-11-09 09:21:25,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 4524 transitions. [2021-11-09 09:21:25,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:25,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 4524 transitions. [2021-11-09 09:21:25,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 122.27027027027027) internal successors, (4524), 37 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:25,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 274.0) internal successors, (10412), 38 states have internal predecessors, (10412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:25,408 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 274.0) internal successors, (10412), 38 states have internal predecessors, (10412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:25,409 INFO L186 Difference]: Start difference. First operand has 303 places, 482 transitions, 2990 flow. Second operand 37 states and 4524 transitions. [2021-11-09 09:21:25,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 737 transitions, 5672 flow [2021-11-09 09:21:25,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 737 transitions, 5612 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-11-09 09:21:25,469 INFO L242 Difference]: Finished difference. Result has 340 places, 521 transitions, 3515 flow [2021-11-09 09:21:25,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2956, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=3515, PETRI_PLACES=340, PETRI_TRANSITIONS=521} [2021-11-09 09:21:25,471 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 63 predicate places. [2021-11-09 09:21:25,471 INFO L470 AbstractCegarLoop]: Abstraction has has 340 places, 521 transitions, 3515 flow [2021-11-09 09:21:25,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 117.6) internal successors, (2352), 20 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:25,472 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:25,472 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:25,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 09:21:25,473 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:25,473 INFO L85 PathProgramCache]: Analyzing trace with hash -537153141, now seen corresponding path program 1 times [2021-11-09 09:21:25,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:25,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356268781] [2021-11-09 09:21:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:25,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:26,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:26,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356268781] [2021-11-09 09:21:26,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356268781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:26,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:26,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-09 09:21:26,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896233626] [2021-11-09 09:21:26,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-09 09:21:26,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-09 09:21:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:21:26,601 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2021-11-09 09:21:26,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 521 transitions, 3515 flow. Second operand has 20 states, 20 states have (on average 119.55) internal successors, (2391), 20 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:26,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:26,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2021-11-09 09:21:26,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:30,319 INFO L129 PetriNetUnfolder]: 2166/6482 cut-off events. [2021-11-09 09:21:30,319 INFO L130 PetriNetUnfolder]: For 12055/12063 co-relation queries the response was YES. [2021-11-09 09:21:30,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20890 conditions, 6482 events. 2166/6482 cut-off events. For 12055/12063 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 52400 event pairs, 259 based on Foata normal form. 18/6358 useless extension candidates. Maximal degree in co-relation 20760. Up to 1602 conditions per place. [2021-11-09 09:21:30,372 INFO L132 encePairwiseOnDemand]: 240/274 looper letters, 682 selfloop transitions, 147 changer transitions 3/938 dead transitions. [2021-11-09 09:21:30,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 938 transitions, 7916 flow [2021-11-09 09:21:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-09 09:21:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-11-09 09:21:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3873 transitions. [2021-11-09 09:21:30,381 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47116788321167885 [2021-11-09 09:21:30,382 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3873 transitions. [2021-11-09 09:21:30,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3873 transitions. [2021-11-09 09:21:30,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:30,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3873 transitions. [2021-11-09 09:21:30,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 129.1) internal successors, (3873), 30 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:30,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 274.0) internal successors, (8494), 31 states have internal predecessors, (8494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:30,408 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 274.0) internal successors, (8494), 31 states have internal predecessors, (8494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:30,408 INFO L186 Difference]: Start difference. First operand has 340 places, 521 transitions, 3515 flow. Second operand 30 states and 3873 transitions. [2021-11-09 09:21:30,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 938 transitions, 7916 flow [2021-11-09 09:21:30,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 938 transitions, 7859 flow, removed 14 selfloop flow, removed 11 redundant places. [2021-11-09 09:21:30,489 INFO L242 Difference]: Finished difference. Result has 368 places, 604 transitions, 4886 flow [2021-11-09 09:21:30,490 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=3469, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4886, PETRI_PLACES=368, PETRI_TRANSITIONS=604} [2021-11-09 09:21:30,490 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 91 predicate places. [2021-11-09 09:21:30,490 INFO L470 AbstractCegarLoop]: Abstraction has has 368 places, 604 transitions, 4886 flow [2021-11-09 09:21:30,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 119.55) internal successors, (2391), 20 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:30,491 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:30,492 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:30,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 09:21:30,492 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:30,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash -109506577, now seen corresponding path program 2 times [2021-11-09 09:21:30,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:30,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339942832] [2021-11-09 09:21:30,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:30,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:31,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:31,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339942832] [2021-11-09 09:21:31,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339942832] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:31,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:31,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-09 09:21:31,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071493173] [2021-11-09 09:21:31,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-09 09:21:31,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:31,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-09 09:21:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-11-09 09:21:31,205 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2021-11-09 09:21:31,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 604 transitions, 4886 flow. Second operand has 21 states, 21 states have (on average 118.33333333333333) internal successors, (2485), 21 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:31,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:31,208 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2021-11-09 09:21:31,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:35,311 INFO L129 PetriNetUnfolder]: 2336/6936 cut-off events. [2021-11-09 09:21:35,311 INFO L130 PetriNetUnfolder]: For 17122/17135 co-relation queries the response was YES. [2021-11-09 09:21:35,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24150 conditions, 6936 events. 2336/6936 cut-off events. For 17122/17135 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 56330 event pairs, 204 based on Foata normal form. 28/6821 useless extension candidates. Maximal degree in co-relation 24007. Up to 1290 conditions per place. [2021-11-09 09:21:35,385 INFO L132 encePairwiseOnDemand]: 241/274 looper letters, 691 selfloop transitions, 201 changer transitions 4/1001 dead transitions. [2021-11-09 09:21:35,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 1001 transitions, 9442 flow [2021-11-09 09:21:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-09 09:21:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-11-09 09:21:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4747 transitions. [2021-11-09 09:21:35,397 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4559162504802151 [2021-11-09 09:21:35,397 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4747 transitions. [2021-11-09 09:21:35,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4747 transitions. [2021-11-09 09:21:35,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:35,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4747 transitions. [2021-11-09 09:21:35,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 124.92105263157895) internal successors, (4747), 38 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:35,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:35,428 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:35,428 INFO L186 Difference]: Start difference. First operand has 368 places, 604 transitions, 4886 flow. Second operand 38 states and 4747 transitions. [2021-11-09 09:21:35,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 1001 transitions, 9442 flow [2021-11-09 09:21:35,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 1001 transitions, 9387 flow, removed 16 selfloop flow, removed 11 redundant places. [2021-11-09 09:21:35,577 INFO L242 Difference]: Finished difference. Result has 408 places, 681 transitions, 6184 flow [2021-11-09 09:21:35,578 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=4845, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=6184, PETRI_PLACES=408, PETRI_TRANSITIONS=681} [2021-11-09 09:21:35,579 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 131 predicate places. [2021-11-09 09:21:35,579 INFO L470 AbstractCegarLoop]: Abstraction has has 408 places, 681 transitions, 6184 flow [2021-11-09 09:21:35,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 118.33333333333333) internal successors, (2485), 21 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:35,580 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:35,580 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:35,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 09:21:35,581 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash -398921851, now seen corresponding path program 3 times [2021-11-09 09:21:35,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:35,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774558084] [2021-11-09 09:21:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:35,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:36,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:36,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774558084] [2021-11-09 09:21:36,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774558084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:36,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:36,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-09 09:21:36,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217585616] [2021-11-09 09:21:36,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-09 09:21:36,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:36,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-09 09:21:36,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:21:36,563 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2021-11-09 09:21:36,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 681 transitions, 6184 flow. Second operand has 20 states, 20 states have (on average 119.55) internal successors, (2391), 20 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:36,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:36,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2021-11-09 09:21:36,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:40,992 INFO L129 PetriNetUnfolder]: 2793/8270 cut-off events. [2021-11-09 09:21:40,992 INFO L130 PetriNetUnfolder]: For 27271/27281 co-relation queries the response was YES. [2021-11-09 09:21:41,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31391 conditions, 8270 events. 2793/8270 cut-off events. For 27271/27281 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 70618 event pairs, 429 based on Foata normal form. 25/8121 useless extension candidates. Maximal degree in co-relation 31230. Up to 1784 conditions per place. [2021-11-09 09:21:41,091 INFO L132 encePairwiseOnDemand]: 240/274 looper letters, 784 selfloop transitions, 213 changer transitions 3/1107 dead transitions. [2021-11-09 09:21:41,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 1107 transitions, 11325 flow [2021-11-09 09:21:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-09 09:21:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-11-09 09:21:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4121 transitions. [2021-11-09 09:21:41,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4700045620437956 [2021-11-09 09:21:41,099 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 4121 transitions. [2021-11-09 09:21:41,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 4121 transitions. [2021-11-09 09:21:41,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:41,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 4121 transitions. [2021-11-09 09:21:41,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 128.78125) internal successors, (4121), 32 states have internal predecessors, (4121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:41,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 274.0) internal successors, (9042), 33 states have internal predecessors, (9042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:41,123 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 274.0) internal successors, (9042), 33 states have internal predecessors, (9042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:41,124 INFO L186 Difference]: Start difference. First operand has 408 places, 681 transitions, 6184 flow. Second operand 32 states and 4121 transitions. [2021-11-09 09:21:41,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 1107 transitions, 11325 flow [2021-11-09 09:21:41,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 1107 transitions, 11171 flow, removed 17 selfloop flow, removed 17 redundant places. [2021-11-09 09:21:41,546 INFO L242 Difference]: Finished difference. Result has 430 places, 751 transitions, 7841 flow [2021-11-09 09:21:41,547 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=6064, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=7841, PETRI_PLACES=430, PETRI_TRANSITIONS=751} [2021-11-09 09:21:41,548 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 153 predicate places. [2021-11-09 09:21:41,548 INFO L470 AbstractCegarLoop]: Abstraction has has 430 places, 751 transitions, 7841 flow [2021-11-09 09:21:41,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 119.55) internal successors, (2391), 20 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:41,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:41,549 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:41,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 09:21:41,550 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash 673449363, now seen corresponding path program 4 times [2021-11-09 09:21:41,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:41,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506144910] [2021-11-09 09:21:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:41,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:42,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:42,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506144910] [2021-11-09 09:21:42,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506144910] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:42,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:42,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-09 09:21:42,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59793067] [2021-11-09 09:21:42,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-09 09:21:42,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-09 09:21:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-11-09 09:21:42,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2021-11-09 09:21:42,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 751 transitions, 7841 flow. Second operand has 23 states, 23 states have (on average 117.8695652173913) internal successors, (2711), 23 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:42,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:42,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2021-11-09 09:21:42,987 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:49,054 INFO L129 PetriNetUnfolder]: 3319/9701 cut-off events. [2021-11-09 09:21:49,054 INFO L130 PetriNetUnfolder]: For 43009/43023 co-relation queries the response was YES. [2021-11-09 09:21:49,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38818 conditions, 9701 events. 3319/9701 cut-off events. For 43009/43023 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 85648 event pairs, 434 based on Foata normal form. 29/9545 useless extension candidates. Maximal degree in co-relation 38647. Up to 1852 conditions per place. [2021-11-09 09:21:49,164 INFO L132 encePairwiseOnDemand]: 237/274 looper letters, 861 selfloop transitions, 280 changer transitions 3/1249 dead transitions. [2021-11-09 09:21:49,164 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 1249 transitions, 14226 flow [2021-11-09 09:21:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-09 09:21:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-11-09 09:21:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4816 transitions. [2021-11-09 09:21:49,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.46254321936227427 [2021-11-09 09:21:49,172 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4816 transitions. [2021-11-09 09:21:49,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4816 transitions. [2021-11-09 09:21:49,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:49,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4816 transitions. [2021-11-09 09:21:49,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 126.73684210526316) internal successors, (4816), 38 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:49,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:49,196 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:49,196 INFO L186 Difference]: Start difference. First operand has 430 places, 751 transitions, 7841 flow. Second operand 38 states and 4816 transitions. [2021-11-09 09:21:49,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 467 places, 1249 transitions, 14226 flow [2021-11-09 09:21:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 1249 transitions, 14120 flow, removed 16 selfloop flow, removed 17 redundant places. [2021-11-09 09:21:49,469 INFO L242 Difference]: Finished difference. Result has 463 places, 842 transitions, 10294 flow [2021-11-09 09:21:49,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=7753, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=10294, PETRI_PLACES=463, PETRI_TRANSITIONS=842} [2021-11-09 09:21:49,470 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 186 predicate places. [2021-11-09 09:21:49,470 INFO L470 AbstractCegarLoop]: Abstraction has has 463 places, 842 transitions, 10294 flow [2021-11-09 09:21:49,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 117.8695652173913) internal successors, (2711), 23 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:49,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:49,471 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:49,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 09:21:49,472 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1594917931, now seen corresponding path program 5 times [2021-11-09 09:21:49,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:49,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742647718] [2021-11-09 09:21:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:49,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:50,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:50,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742647718] [2021-11-09 09:21:50,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742647718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:50,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:50,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-09 09:21:50,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590935963] [2021-11-09 09:21:50,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-09 09:21:50,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:50,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-09 09:21:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-11-09 09:21:50,415 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2021-11-09 09:21:50,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 842 transitions, 10294 flow. Second operand has 22 states, 22 states have (on average 118.0909090909091) internal successors, (2598), 22 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:50,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:50,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2021-11-09 09:21:50,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:21:57,154 INFO L129 PetriNetUnfolder]: 3752/10936 cut-off events. [2021-11-09 09:21:57,154 INFO L130 PetriNetUnfolder]: For 63515/63531 co-relation queries the response was YES. [2021-11-09 09:21:57,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46483 conditions, 10936 events. 3752/10936 cut-off events. For 63515/63531 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 99395 event pairs, 365 based on Foata normal form. 31/10774 useless extension candidates. Maximal degree in co-relation 46296. Up to 1795 conditions per place. [2021-11-09 09:21:57,322 INFO L132 encePairwiseOnDemand]: 237/274 looper letters, 943 selfloop transitions, 349 changer transitions 4/1401 dead transitions. [2021-11-09 09:21:57,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 1401 transitions, 18118 flow [2021-11-09 09:21:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-09 09:21:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-11-09 09:21:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4843 transitions. [2021-11-09 09:21:57,332 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.46513638109873223 [2021-11-09 09:21:57,332 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4843 transitions. [2021-11-09 09:21:57,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4843 transitions. [2021-11-09 09:21:57,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:21:57,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4843 transitions. [2021-11-09 09:21:57,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 127.44736842105263) internal successors, (4843), 38 states have internal predecessors, (4843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:57,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:57,354 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 274.0) internal successors, (10686), 39 states have internal predecessors, (10686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:57,355 INFO L186 Difference]: Start difference. First operand has 463 places, 842 transitions, 10294 flow. Second operand 38 states and 4843 transitions. [2021-11-09 09:21:57,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 1401 transitions, 18118 flow [2021-11-09 09:21:57,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 1401 transitions, 17967 flow, removed 54 selfloop flow, removed 14 redundant places. [2021-11-09 09:21:57,826 INFO L242 Difference]: Finished difference. Result has 500 places, 931 transitions, 13322 flow [2021-11-09 09:21:57,827 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=10159, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=842, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=13322, PETRI_PLACES=500, PETRI_TRANSITIONS=931} [2021-11-09 09:21:57,827 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 223 predicate places. [2021-11-09 09:21:57,827 INFO L470 AbstractCegarLoop]: Abstraction has has 500 places, 931 transitions, 13322 flow [2021-11-09 09:21:57,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 118.0909090909091) internal successors, (2598), 22 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:57,828 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:21:57,828 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:21:57,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 09:21:57,828 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:21:57,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:21:57,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1484130291, now seen corresponding path program 1 times [2021-11-09 09:21:57,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:21:57,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096600734] [2021-11-09 09:21:57,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:21:57,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:21:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:21:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:21:57,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:21:57,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096600734] [2021-11-09 09:21:57,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096600734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:21:57,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:21:57,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:21:57,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642744772] [2021-11-09 09:21:57,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:21:57,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:21:57,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:21:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:21:57,938 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 274 [2021-11-09 09:21:57,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 931 transitions, 13322 flow. Second operand has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:21:57,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:21:57,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 274 [2021-11-09 09:21:57,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:22:01,439 INFO L129 PetriNetUnfolder]: 3001/9782 cut-off events. [2021-11-09 09:22:01,439 INFO L130 PetriNetUnfolder]: For 69762/70004 co-relation queries the response was YES. [2021-11-09 09:22:01,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43177 conditions, 9782 events. 3001/9782 cut-off events. For 69762/70004 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 91769 event pairs, 1041 based on Foata normal form. 106/9740 useless extension candidates. Maximal degree in co-relation 42994. Up to 5787 conditions per place. [2021-11-09 09:22:01,620 INFO L132 encePairwiseOnDemand]: 251/274 looper letters, 606 selfloop transitions, 97 changer transitions 106/1065 dead transitions. [2021-11-09 09:22:01,620 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1065 transitions, 16108 flow [2021-11-09 09:22:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:22:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-09 09:22:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1159 transitions. [2021-11-09 09:22:01,622 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7049878345498783 [2021-11-09 09:22:01,622 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1159 transitions. [2021-11-09 09:22:01,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1159 transitions. [2021-11-09 09:22:01,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:22:01,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1159 transitions. [2021-11-09 09:22:01,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:01,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:01,626 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:01,626 INFO L186 Difference]: Start difference. First operand has 500 places, 931 transitions, 13322 flow. Second operand 6 states and 1159 transitions. [2021-11-09 09:22:01,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 1065 transitions, 16108 flow [2021-11-09 09:22:02,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 1065 transitions, 15984 flow, removed 43 selfloop flow, removed 15 redundant places. [2021-11-09 09:22:02,473 INFO L242 Difference]: Finished difference. Result has 495 places, 926 transitions, 12877 flow [2021-11-09 09:22:02,475 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=13198, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=931, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12877, PETRI_PLACES=495, PETRI_TRANSITIONS=926} [2021-11-09 09:22:02,476 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 218 predicate places. [2021-11-09 09:22:02,476 INFO L470 AbstractCegarLoop]: Abstraction has has 495 places, 926 transitions, 12877 flow [2021-11-09 09:22:02,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:02,476 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:22:02,477 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:22:02,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 09:22:02,477 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:22:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:22:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1924242366, now seen corresponding path program 1 times [2021-11-09 09:22:02,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:22:02,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783484723] [2021-11-09 09:22:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:22:02,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:22:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:22:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:22:03,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:22:03,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783484723] [2021-11-09 09:22:03,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783484723] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:22:03,608 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:22:03,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-09 09:22:03,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490080294] [2021-11-09 09:22:03,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-09 09:22:03,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:22:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-09 09:22:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:22:03,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2021-11-09 09:22:03,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 926 transitions, 12877 flow. Second operand has 20 states, 20 states have (on average 119.8) internal successors, (2396), 20 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:03,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:22:03,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2021-11-09 09:22:03,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:22:10,087 INFO L129 PetriNetUnfolder]: 3658/10735 cut-off events. [2021-11-09 09:22:10,087 INFO L130 PetriNetUnfolder]: For 85473/85478 co-relation queries the response was YES. [2021-11-09 09:22:10,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50412 conditions, 10735 events. 3658/10735 cut-off events. For 85473/85478 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 96831 event pairs, 480 based on Foata normal form. 10/10669 useless extension candidates. Maximal degree in co-relation 50208. Up to 2252 conditions per place. [2021-11-09 09:22:10,353 INFO L132 encePairwiseOnDemand]: 244/274 looper letters, 794 selfloop transitions, 250 changer transitions 29/1180 dead transitions. [2021-11-09 09:22:10,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 1180 transitions, 17025 flow [2021-11-09 09:22:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-09 09:22:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-11-09 09:22:10,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4269 transitions. [2021-11-09 09:22:10,360 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.45824388149420353 [2021-11-09 09:22:10,360 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4269 transitions. [2021-11-09 09:22:10,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4269 transitions. [2021-11-09 09:22:10,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:22:10,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4269 transitions. [2021-11-09 09:22:10,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 125.55882352941177) internal successors, (4269), 34 states have internal predecessors, (4269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:10,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 274.0) internal successors, (9590), 35 states have internal predecessors, (9590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:10,380 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 274.0) internal successors, (9590), 35 states have internal predecessors, (9590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:10,381 INFO L186 Difference]: Start difference. First operand has 495 places, 926 transitions, 12877 flow. Second operand 34 states and 4269 transitions. [2021-11-09 09:22:10,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 1180 transitions, 17025 flow [2021-11-09 09:22:11,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 1180 transitions, 16611 flow, removed 139 selfloop flow, removed 11 redundant places. [2021-11-09 09:22:11,237 INFO L242 Difference]: Finished difference. Result has 496 places, 935 transitions, 13437 flow [2021-11-09 09:22:11,238 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=12503, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=926, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=13437, PETRI_PLACES=496, PETRI_TRANSITIONS=935} [2021-11-09 09:22:11,239 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 219 predicate places. [2021-11-09 09:22:11,239 INFO L470 AbstractCegarLoop]: Abstraction has has 496 places, 935 transitions, 13437 flow [2021-11-09 09:22:11,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 119.8) internal successors, (2396), 20 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:11,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:22:11,239 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:22:11,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 09:22:11,240 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:22:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:22:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 13963644, now seen corresponding path program 2 times [2021-11-09 09:22:11,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:22:11,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390168880] [2021-11-09 09:22:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:22:11,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:22:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:22:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:22:11,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:22:11,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390168880] [2021-11-09 09:22:11,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390168880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:22:11,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:22:11,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-09 09:22:11,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949713177] [2021-11-09 09:22:11,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-09 09:22:11,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:22:11,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-09 09:22:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-11-09 09:22:11,934 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2021-11-09 09:22:11,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 935 transitions, 13437 flow. Second operand has 21 states, 21 states have (on average 118.57142857142857) internal successors, (2490), 21 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:11,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:22:11,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2021-11-09 09:22:11,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:22:18,411 INFO L129 PetriNetUnfolder]: 3718/10828 cut-off events. [2021-11-09 09:22:18,411 INFO L130 PetriNetUnfolder]: For 98270/98275 co-relation queries the response was YES. [2021-11-09 09:22:18,548 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52159 conditions, 10828 events. 3718/10828 cut-off events. For 98270/98275 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 97594 event pairs, 447 based on Foata normal form. 10/10769 useless extension candidates. Maximal degree in co-relation 51954. Up to 1999 conditions per place. [2021-11-09 09:22:18,725 INFO L132 encePairwiseOnDemand]: 240/274 looper letters, 885 selfloop transitions, 269 changer transitions 31/1290 dead transitions. [2021-11-09 09:22:18,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 1290 transitions, 18960 flow [2021-11-09 09:22:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-09 09:22:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-11-09 09:22:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 4496 transitions. [2021-11-09 09:22:18,732 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4557988645579886 [2021-11-09 09:22:18,733 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 4496 transitions. [2021-11-09 09:22:18,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 4496 transitions. [2021-11-09 09:22:18,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:22:18,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 4496 transitions. [2021-11-09 09:22:18,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 124.88888888888889) internal successors, (4496), 36 states have internal predecessors, (4496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:18,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 274.0) internal successors, (10138), 37 states have internal predecessors, (10138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:18,753 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 274.0) internal successors, (10138), 37 states have internal predecessors, (10138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:18,754 INFO L186 Difference]: Start difference. First operand has 496 places, 935 transitions, 13437 flow. Second operand 36 states and 4496 transitions. [2021-11-09 09:22:18,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 1290 transitions, 18960 flow [2021-11-09 09:22:19,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 1290 transitions, 18627 flow, removed 12 selfloop flow, removed 31 redundant places. [2021-11-09 09:22:19,344 INFO L242 Difference]: Finished difference. Result has 504 places, 947 transitions, 14068 flow [2021-11-09 09:22:19,345 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=13104, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=14068, PETRI_PLACES=504, PETRI_TRANSITIONS=947} [2021-11-09 09:22:19,345 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 227 predicate places. [2021-11-09 09:22:19,345 INFO L470 AbstractCegarLoop]: Abstraction has has 504 places, 947 transitions, 14068 flow [2021-11-09 09:22:19,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 118.57142857142857) internal successors, (2490), 21 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:19,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:22:19,346 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:22:19,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 09:22:19,346 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:22:19,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:22:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1570618162, now seen corresponding path program 3 times [2021-11-09 09:22:19,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:22:19,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369345135] [2021-11-09 09:22:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:22:19,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:22:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:22:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:22:20,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:22:20,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369345135] [2021-11-09 09:22:20,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369345135] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:22:20,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:22:20,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-11-09 09:22:20,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913147743] [2021-11-09 09:22:20,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-09 09:22:20,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:22:20,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-09 09:22:20,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-11-09 09:22:20,653 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2021-11-09 09:22:20,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 947 transitions, 14068 flow. Second operand has 23 states, 23 states have (on average 118.08695652173913) internal successors, (2716), 23 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:20,656 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:22:20,656 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2021-11-09 09:22:20,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:22:28,320 INFO L129 PetriNetUnfolder]: 3932/11284 cut-off events. [2021-11-09 09:22:28,320 INFO L130 PetriNetUnfolder]: For 115388/115393 co-relation queries the response was YES. [2021-11-09 09:22:28,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56321 conditions, 11284 events. 3932/11284 cut-off events. For 115388/115393 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 102219 event pairs, 756 based on Foata normal form. 10/11160 useless extension candidates. Maximal degree in co-relation 56112. Up to 4122 conditions per place. [2021-11-09 09:22:28,523 INFO L132 encePairwiseOnDemand]: 245/274 looper letters, 1018 selfloop transitions, 142 changer transitions 42/1307 dead transitions. [2021-11-09 09:22:28,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 1307 transitions, 19705 flow [2021-11-09 09:22:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-09 09:22:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-11-09 09:22:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4279 transitions. [2021-11-09 09:22:28,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.45931730356376127 [2021-11-09 09:22:28,529 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4279 transitions. [2021-11-09 09:22:28,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4279 transitions. [2021-11-09 09:22:28,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:22:28,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4279 transitions. [2021-11-09 09:22:28,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 125.8529411764706) internal successors, (4279), 34 states have internal predecessors, (4279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:28,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 274.0) internal successors, (9590), 35 states have internal predecessors, (9590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:28,548 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 274.0) internal successors, (9590), 35 states have internal predecessors, (9590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:28,549 INFO L186 Difference]: Start difference. First operand has 504 places, 947 transitions, 14068 flow. Second operand 34 states and 4279 transitions. [2021-11-09 09:22:28,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 1307 transitions, 19705 flow [2021-11-09 09:22:29,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 1307 transitions, 19170 flow, removed 30 selfloop flow, removed 31 redundant places. [2021-11-09 09:22:29,365 INFO L242 Difference]: Finished difference. Result has 508 places, 973 transitions, 14783 flow [2021-11-09 09:22:29,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=13576, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=805, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=14783, PETRI_PLACES=508, PETRI_TRANSITIONS=973} [2021-11-09 09:22:29,367 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 231 predicate places. [2021-11-09 09:22:29,367 INFO L470 AbstractCegarLoop]: Abstraction has has 508 places, 973 transitions, 14783 flow [2021-11-09 09:22:29,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 118.08695652173913) internal successors, (2716), 23 states have internal predecessors, (2716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:29,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:22:29,368 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:22:29,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 09:22:29,369 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:22:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:22:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1407877920, now seen corresponding path program 4 times [2021-11-09 09:22:29,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:22:29,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081116423] [2021-11-09 09:22:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:22:29,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:22:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:22:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:22:29,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:22:29,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081116423] [2021-11-09 09:22:29,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081116423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:22:29,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:22:29,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-11-09 09:22:29,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388706899] [2021-11-09 09:22:29,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-09 09:22:29,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:22:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-09 09:22:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:22:29,887 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 274 [2021-11-09 09:22:29,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 973 transitions, 14783 flow. Second operand has 20 states, 20 states have (on average 119.8) internal successors, (2396), 20 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:29,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:22:29,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 274 [2021-11-09 09:22:29,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:22:37,385 INFO L129 PetriNetUnfolder]: 3874/11212 cut-off events. [2021-11-09 09:22:37,385 INFO L130 PetriNetUnfolder]: For 111129/111135 co-relation queries the response was YES. [2021-11-09 09:22:37,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55083 conditions, 11212 events. 3874/11212 cut-off events. For 111129/111135 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 102194 event pairs, 487 based on Foata normal form. 10/11145 useless extension candidates. Maximal degree in co-relation 54871. Up to 2755 conditions per place. [2021-11-09 09:22:37,580 INFO L132 encePairwiseOnDemand]: 242/274 looper letters, 808 selfloop transitions, 323 changer transitions 28/1266 dead transitions. [2021-11-09 09:22:37,580 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 1266 transitions, 19178 flow [2021-11-09 09:22:37,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-09 09:22:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-11-09 09:22:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 5244 transitions. [2021-11-09 09:22:37,587 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4556830031282586 [2021-11-09 09:22:37,587 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 5244 transitions. [2021-11-09 09:22:37,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 5244 transitions. [2021-11-09 09:22:37,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:22:37,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 5244 transitions. [2021-11-09 09:22:37,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 124.85714285714286) internal successors, (5244), 42 states have internal predecessors, (5244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:37,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 274.0) internal successors, (11782), 43 states have internal predecessors, (11782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:37,611 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 274.0) internal successors, (11782), 43 states have internal predecessors, (11782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:37,611 INFO L186 Difference]: Start difference. First operand has 508 places, 973 transitions, 14783 flow. Second operand 42 states and 5244 transitions. [2021-11-09 09:22:37,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 1266 transitions, 19178 flow [2021-11-09 09:22:38,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 1266 transitions, 18911 flow, removed 19 selfloop flow, removed 26 redundant places. [2021-11-09 09:22:38,392 INFO L242 Difference]: Finished difference. Result has 530 places, 989 transitions, 15727 flow [2021-11-09 09:22:38,394 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=14521, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=15727, PETRI_PLACES=530, PETRI_TRANSITIONS=989} [2021-11-09 09:22:38,394 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 253 predicate places. [2021-11-09 09:22:38,395 INFO L470 AbstractCegarLoop]: Abstraction has has 530 places, 989 transitions, 15727 flow [2021-11-09 09:22:38,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 119.8) internal successors, (2396), 20 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:38,395 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:22:38,396 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:22:38,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-09 09:22:38,396 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:22:38,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:22:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash -754118565, now seen corresponding path program 1 times [2021-11-09 09:22:38,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:22:38,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141075161] [2021-11-09 09:22:38,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:22:38,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:22:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:22:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:22:39,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:22:39,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141075161] [2021-11-09 09:22:39,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141075161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:22:39,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:22:39,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-09 09:22:39,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488156621] [2021-11-09 09:22:39,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-09 09:22:39,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:22:39,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 09:22:39,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-11-09 09:22:39,390 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 274 [2021-11-09 09:22:39,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 989 transitions, 15727 flow. Second operand has 25 states, 25 states have (on average 116.68) internal successors, (2917), 25 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:39,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:22:39,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 274 [2021-11-09 09:22:39,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:22:48,152 INFO L129 PetriNetUnfolder]: 4288/12442 cut-off events. [2021-11-09 09:22:48,152 INFO L130 PetriNetUnfolder]: For 136674/136679 co-relation queries the response was YES. [2021-11-09 09:22:48,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62206 conditions, 12442 events. 4288/12442 cut-off events. For 136674/136679 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 114314 event pairs, 830 based on Foata normal form. 17/12376 useless extension candidates. Maximal degree in co-relation 61986. Up to 2113 conditions per place. [2021-11-09 09:22:48,557 INFO L132 encePairwiseOnDemand]: 240/274 looper letters, 1142 selfloop transitions, 224 changer transitions 131/1601 dead transitions. [2021-11-09 09:22:48,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 1601 transitions, 25392 flow [2021-11-09 09:22:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-09 09:22:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-11-09 09:22:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 7057 transitions. [2021-11-09 09:22:48,564 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.44405990435439213 [2021-11-09 09:22:48,565 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 7057 transitions. [2021-11-09 09:22:48,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 7057 transitions. [2021-11-09 09:22:48,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:22:48,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 7057 transitions. [2021-11-09 09:22:48,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 121.67241379310344) internal successors, (7057), 58 states have internal predecessors, (7057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:48,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 274.0) internal successors, (16166), 59 states have internal predecessors, (16166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:48,597 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 274.0) internal successors, (16166), 59 states have internal predecessors, (16166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:48,597 INFO L186 Difference]: Start difference. First operand has 530 places, 989 transitions, 15727 flow. Second operand 58 states and 7057 transitions. [2021-11-09 09:22:48,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 1601 transitions, 25392 flow [2021-11-09 09:22:49,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 1601 transitions, 24600 flow, removed 166 selfloop flow, removed 40 redundant places. [2021-11-09 09:22:49,654 INFO L242 Difference]: Finished difference. Result has 559 places, 1042 transitions, 16163 flow [2021-11-09 09:22:49,655 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=15199, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=16163, PETRI_PLACES=559, PETRI_TRANSITIONS=1042} [2021-11-09 09:22:49,656 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 282 predicate places. [2021-11-09 09:22:49,656 INFO L470 AbstractCegarLoop]: Abstraction has has 559 places, 1042 transitions, 16163 flow [2021-11-09 09:22:49,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 116.68) internal successors, (2917), 25 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:49,657 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:22:49,657 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:22:49,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-09 09:22:49,658 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:22:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:22:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 776959975, now seen corresponding path program 2 times [2021-11-09 09:22:49,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:22:49,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043855274] [2021-11-09 09:22:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:22:49,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:22:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:22:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:22:50,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:22:50,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043855274] [2021-11-09 09:22:50,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043855274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:22:50,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:22:50,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-09 09:22:50,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110353516] [2021-11-09 09:22:50,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-09 09:22:50,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:22:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 09:22:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-11-09 09:22:50,992 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 274 [2021-11-09 09:22:50,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 1042 transitions, 16163 flow. Second operand has 25 states, 25 states have (on average 116.68) internal successors, (2917), 25 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:22:50,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:22:50,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 274 [2021-11-09 09:22:50,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:23:01,946 INFO L129 PetriNetUnfolder]: 5129/14658 cut-off events. [2021-11-09 09:23:01,946 INFO L130 PetriNetUnfolder]: For 162906/162912 co-relation queries the response was YES. [2021-11-09 09:23:02,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74099 conditions, 14658 events. 5129/14658 cut-off events. For 162906/162912 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 138114 event pairs, 1040 based on Foata normal form. 12/14570 useless extension candidates. Maximal degree in co-relation 73881. Up to 2160 conditions per place. [2021-11-09 09:23:02,285 INFO L132 encePairwiseOnDemand]: 233/274 looper letters, 1196 selfloop transitions, 280 changer transitions 44/1624 dead transitions. [2021-11-09 09:23:02,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 1624 transitions, 26117 flow [2021-11-09 09:23:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-09 09:23:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-11-09 09:23:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 6222 transitions. [2021-11-09 09:23:02,294 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.44525547445255476 [2021-11-09 09:23:02,294 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 6222 transitions. [2021-11-09 09:23:02,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 6222 transitions. [2021-11-09 09:23:02,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:23:02,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 6222 transitions. [2021-11-09 09:23:02,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 122.0) internal successors, (6222), 51 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:02,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 274.0) internal successors, (14248), 52 states have internal predecessors, (14248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:02,329 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 274.0) internal successors, (14248), 52 states have internal predecessors, (14248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:02,329 INFO L186 Difference]: Start difference. First operand has 559 places, 1042 transitions, 16163 flow. Second operand 51 states and 6222 transitions. [2021-11-09 09:23:02,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 1624 transitions, 26117 flow [2021-11-09 09:23:03,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 1624 transitions, 25819 flow, removed 13 selfloop flow, removed 27 redundant places. [2021-11-09 09:23:03,471 INFO L242 Difference]: Finished difference. Result has 582 places, 1134 transitions, 18656 flow [2021-11-09 09:23:03,472 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=15926, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=18656, PETRI_PLACES=582, PETRI_TRANSITIONS=1134} [2021-11-09 09:23:03,472 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 305 predicate places. [2021-11-09 09:23:03,472 INFO L470 AbstractCegarLoop]: Abstraction has has 582 places, 1134 transitions, 18656 flow [2021-11-09 09:23:03,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 116.68) internal successors, (2917), 25 states have internal predecessors, (2917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:03,473 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:23:03,473 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:23:03,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-09 09:23:03,474 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:23:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:23:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash -534033321, now seen corresponding path program 1 times [2021-11-09 09:23:03,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:23:03,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118894430] [2021-11-09 09:23:03,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:23:03,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:23:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:23:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:23:04,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:23:04,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118894430] [2021-11-09 09:23:04,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118894430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:23:04,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:23:04,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-11-09 09:23:04,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215126321] [2021-11-09 09:23:04,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-09 09:23:04,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:23:04,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-09 09:23:04,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-11-09 09:23:04,155 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 274 [2021-11-09 09:23:04,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 1134 transitions, 18656 flow. Second operand has 22 states, 22 states have (on average 115.36363636363636) internal successors, (2538), 22 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:04,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:23:04,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 274 [2021-11-09 09:23:04,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:23:15,571 INFO L129 PetriNetUnfolder]: 5373/15138 cut-off events. [2021-11-09 09:23:15,572 INFO L130 PetriNetUnfolder]: For 169602/169608 co-relation queries the response was YES. [2021-11-09 09:23:15,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77254 conditions, 15138 events. 5373/15138 cut-off events. For 169602/169608 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 143019 event pairs, 941 based on Foata normal form. 22/15031 useless extension candidates. Maximal degree in co-relation 77029. Up to 2769 conditions per place. [2021-11-09 09:23:15,913 INFO L132 encePairwiseOnDemand]: 234/274 looper letters, 1010 selfloop transitions, 302 changer transitions 81/1495 dead transitions. [2021-11-09 09:23:15,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 1495 transitions, 25660 flow [2021-11-09 09:23:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-09 09:23:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-11-09 09:23:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4989 transitions. [2021-11-09 09:23:15,917 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4440982730995193 [2021-11-09 09:23:15,917 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4989 transitions. [2021-11-09 09:23:15,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4989 transitions. [2021-11-09 09:23:15,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:23:15,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4989 transitions. [2021-11-09 09:23:15,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 121.6829268292683) internal successors, (4989), 41 states have internal predecessors, (4989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:15,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 274.0) internal successors, (11508), 42 states have internal predecessors, (11508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:15,938 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 274.0) internal successors, (11508), 42 states have internal predecessors, (11508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:15,938 INFO L186 Difference]: Start difference. First operand has 582 places, 1134 transitions, 18656 flow. Second operand 41 states and 4989 transitions. [2021-11-09 09:23:15,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 1495 transitions, 25660 flow [2021-11-09 09:23:16,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 1495 transitions, 25259 flow, removed 43 selfloop flow, removed 25 redundant places. [2021-11-09 09:23:16,925 INFO L242 Difference]: Finished difference. Result has 607 places, 1159 transitions, 19705 flow [2021-11-09 09:23:16,926 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=18291, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=19705, PETRI_PLACES=607, PETRI_TRANSITIONS=1159} [2021-11-09 09:23:16,927 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 330 predicate places. [2021-11-09 09:23:16,927 INFO L470 AbstractCegarLoop]: Abstraction has has 607 places, 1159 transitions, 19705 flow [2021-11-09 09:23:16,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 115.36363636363636) internal successors, (2538), 22 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:16,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:23:16,928 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:23:16,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-09 09:23:16,928 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:23:16,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:23:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2004513095, now seen corresponding path program 3 times [2021-11-09 09:23:16,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:23:16,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507649175] [2021-11-09 09:23:16,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:23:16,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:23:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:23:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:23:18,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:23:18,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507649175] [2021-11-09 09:23:18,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507649175] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:23:18,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:23:18,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-09 09:23:18,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101319261] [2021-11-09 09:23:18,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-09 09:23:18,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:23:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-09 09:23:18,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2021-11-09 09:23:18,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 274 [2021-11-09 09:23:18,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 1159 transitions, 19705 flow. Second operand has 24 states, 24 states have (on average 116.875) internal successors, (2805), 24 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:18,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-09 09:23:18,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 274 [2021-11-09 09:23:18,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-09 09:23:28,960 INFO L129 PetriNetUnfolder]: 5053/14292 cut-off events. [2021-11-09 09:23:28,961 INFO L130 PetriNetUnfolder]: For 178140/178144 co-relation queries the response was YES. [2021-11-09 09:23:29,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77466 conditions, 14292 events. 5053/14292 cut-off events. For 178140/178144 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 133068 event pairs, 1134 based on Foata normal form. 11/14152 useless extension candidates. Maximal degree in co-relation 77232. Up to 3505 conditions per place. [2021-11-09 09:23:29,316 INFO L132 encePairwiseOnDemand]: 244/274 looper letters, 1032 selfloop transitions, 146 changer transitions 52/1334 dead transitions. [2021-11-09 09:23:29,316 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 1334 transitions, 24103 flow [2021-11-09 09:23:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-11-09 09:23:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-11-09 09:23:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4221 transitions. [2021-11-09 09:23:29,320 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4401459854014598 [2021-11-09 09:23:29,320 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 4221 transitions. [2021-11-09 09:23:29,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 4221 transitions. [2021-11-09 09:23:29,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-09 09:23:29,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 4221 transitions. [2021-11-09 09:23:29,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 120.6) internal successors, (4221), 35 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:29,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 274.0) internal successors, (9864), 36 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:29,331 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 274.0) internal successors, (9864), 36 states have internal predecessors, (9864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:29,331 INFO L186 Difference]: Start difference. First operand has 607 places, 1159 transitions, 19705 flow. Second operand 35 states and 4221 transitions. [2021-11-09 09:23:29,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 1334 transitions, 24103 flow [2021-11-09 09:23:30,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 1334 transitions, 23566 flow, removed 36 selfloop flow, removed 26 redundant places. [2021-11-09 09:23:30,433 INFO L242 Difference]: Finished difference. Result has 610 places, 1149 transitions, 19363 flow [2021-11-09 09:23:30,435 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=19162, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1012, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=19363, PETRI_PLACES=610, PETRI_TRANSITIONS=1149} [2021-11-09 09:23:30,435 INFO L334 CegarLoopForPetriNet]: 277 programPoint places, 333 predicate places. [2021-11-09 09:23:30,435 INFO L470 AbstractCegarLoop]: Abstraction has has 610 places, 1149 transitions, 19363 flow [2021-11-09 09:23:30,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 116.875) internal successors, (2805), 24 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:23:30,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-09 09:23:30,436 INFO L254 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:23:30,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-09 09:23:30,436 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-11-09 09:23:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:23:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 573621416, now seen corresponding path program 1 times [2021-11-09 09:23:30,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:23:30,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941685606] [2021-11-09 09:23:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:23:30,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:23:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:23:30,554 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:23:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:23:30,751 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:23:30,751 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 09:23:30,752 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-09 09:23:30,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE [2021-11-09 09:23:30,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-09 09:23:30,766 INFO L731 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:23:30,774 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-09 09:23:30,775 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:23:31,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:23:31 BasicIcfg [2021-11-09 09:23:31,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:23:31,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:23:31,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:23:31,104 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:23:31,105 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:21:04" (3/4) ... [2021-11-09 09:23:31,108 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-09 09:23:31,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:23:31,110 INFO L168 Benchmark]: Toolchain (without parser) took 148535.73 ms. Allocated memory was 100.7 MB in the beginning and 9.8 GB in the end (delta: 9.7 GB). Free memory was 67.1 MB in the beginning and 7.2 GB in the end (delta: -7.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 16.1 GB. [2021-11-09 09:23:31,110 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 100.7 MB. Free memory is still 55.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:23:31,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 998.85 ms. Allocated memory is still 100.7 MB. Free memory was 66.8 MB in the beginning and 49.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:23:31,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.57 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 49.0 MB in the beginning and 101.7 MB in the end (delta: -52.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:23:31,112 INFO L168 Benchmark]: Boogie Preprocessor took 54.41 ms. Allocated memory is still 125.8 MB. Free memory was 101.7 MB in the beginning and 98.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:23:31,112 INFO L168 Benchmark]: RCFGBuilder took 958.66 ms. Allocated memory is still 125.8 MB. Free memory was 98.3 MB in the beginning and 73.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:23:31,113 INFO L168 Benchmark]: TraceAbstraction took 146422.57 ms. Allocated memory was 125.8 MB in the beginning and 9.8 GB in the end (delta: 9.6 GB). Free memory was 72.3 MB in the beginning and 7.2 GB in the end (delta: -7.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 16.1 GB. [2021-11-09 09:23:31,113 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 9.8 GB. Free memory is still 7.2 GB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:23:31,116 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.27 ms. Allocated memory is still 100.7 MB. Free memory is still 55.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 998.85 ms. Allocated memory is still 100.7 MB. Free memory was 66.8 MB in the beginning and 49.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 89.57 ms. Allocated memory was 100.7 MB in the beginning and 125.8 MB in the end (delta: 25.2 MB). Free memory was 49.0 MB in the beginning and 101.7 MB in the end (delta: -52.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.41 ms. Allocated memory is still 125.8 MB. Free memory was 101.7 MB in the beginning and 98.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 958.66 ms. Allocated memory is still 125.8 MB. Free memory was 98.3 MB in the beginning and 73.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 146422.57 ms. Allocated memory was 125.8 MB in the beginning and 9.8 GB in the end (delta: 9.6 GB). Free memory was 72.3 MB in the beginning and 7.2 GB in the end (delta: -7.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 16.1 GB. * Witness Printer took 4.74 ms. Allocated memory is still 9.8 GB. Free memory is still 7.2 GB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 1259]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={17:0}, B={0:0}] [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1243] 0 pthread_t t1; VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1244] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1229] 0 p -> next = ((void *)0) VAL [A={0:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1246] 0 A = malloc(sizeof(struct s)) VAL [A={11:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1247] 0 init(A,3) VAL [A={11:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1228] 0 p -> datum = x VAL [A={11:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1229] 0 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1248] EXPR 0 A->next VAL [A={11:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1248] 0 A->next = p VAL [A={11:0}, A_mutex={17:0}, B={0:0}, B_mutex={18:0}] [L1249] 0 B = malloc(sizeof(struct s)) VAL [A={11:0}, A_mutex={17:0}, B={-3:0}, B_mutex={18:0}] [L1250] 0 init(B,5) VAL [A={11:0}, A_mutex={17:0}, B={-3:0}, B_mutex={18:0}] [L1228] 0 p -> datum = x VAL [A={11:0}, A_mutex={17:0}, B={-3:0}, B_mutex={18:0}] [L1229] 0 p -> next = ((void *)0) VAL [A={11:0}, A_mutex={17:0}, B={-3:0}, B_mutex={18:0}] [L1251] EXPR 0 B->next VAL [A={11:0}, A_mutex={17:0}, B={-3:0}, B_mutex={18:0}] [L1251] 0 B->next = p VAL [A={11:0}, A_mutex={17:0}, B={-3:0}, B_mutex={18:0}] [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={11:0}, A_mutex={17:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1254] EXPR 0 A->next VAL [A={11:0}, A_mutex={17:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1254] 0 p = A->next VAL [A={11:0}, A_mutex={17:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1255] EXPR 0 p->datum VAL [A={11:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1255] 0 printf("%d\n", p->datum) VAL [A={11:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] EXPR 1 A->next VAL [A={11:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1258] EXPR 0 B->next VAL [A={11:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] EXPR 1 A->next VAL [A={11:0}, A->next={-2:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] EXPR 1 A->next->datum VAL [A={11:0}, A->next={-2:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1258] 0 p = B->next VAL [A={11:0}, A->next={-2:0}, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] EXPR 1 A->next->datum VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1258] 0 p = B->next VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1258] 0 p = B->next VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1258] 0 p = B->next VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1258] 0 p = B->next VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1258] 0 p = B->next VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1259] EXPR 0 p->datum VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1235] 1 A->next->datum++ VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=108, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={11:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=108, A->next->datum++=9, A_mutex={17:0}, arg={0:0}, arg={0:0}, B={-3:0}, B_mutex={18:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: B->next = p [1251] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: A->next = p [1248] * C: A->next->datum++ [1235] * C: B->next = p [1251] * C: B->next = p [1251] * C: p -> datum = x [1228] * C: B->next = p [1251] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: p -> datum = x [1228] and C: printf("%d\n", p->datum) [1259] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: 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. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 346 locations, 37 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: 145.9s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 129.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2252 SDtfs, 10609 SDslu, 8943 SDs, 0 SdLazy, 40068 SolverSat, 6011 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 937 GetRequests, 45 SyntacticMatches, 129 SemanticMatches, 763 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10491 ImplicationChecksByTransitivity, 18.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19705occurred in iteration=29, InterpolantAutomatonStates: 625, 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.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 4851 NumberOfCodeBlocks, 4851 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4623 ConstructedInterpolants, 0 QuantifiedInterpolants, 55878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-09 09:23:31,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b601e165-73c9-44ba-a595-37ad061d2d40/bin/uautomizer-IVEQpCNsaX/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