./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/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_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa --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.2-hotfix-svcomp22-839c364 [2021-12-06 21:06:39,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:06:39,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:06:39,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:06:39,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:06:39,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:06:39,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:06:39,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:06:39,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:06:39,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:06:39,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:06:39,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:06:39,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:06:39,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:06:39,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:06:39,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:06:39,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:06:39,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:06:39,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:06:39,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:06:39,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:06:39,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:06:39,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:06:39,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:06:39,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:06:39,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:06:39,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:06:39,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:06:39,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:06:39,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:06:39,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:06:39,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:06:39,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:06:39,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:06:39,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:06:39,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:06:39,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:06:39,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:06:39,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:06:39,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:06:39,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:06:39,400 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/config/svcomp-DataRace-32bit-Automizer_Default.epf [2021-12-06 21:06:39,417 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:06:39,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:06:39,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:06:39,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:06:39,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:06:39,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:06:39,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:06:39,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:06:39,418 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:06:39,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:06:39,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 21:06:39,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:06:39,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:06:39,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 21:06:39,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:06:39,422 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_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/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_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa 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-12-06 21:06:39,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:06:39,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:06:39,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:06:39,630 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:06:39,631 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:06:39,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2021-12-06 21:06:39,673 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/data/4be79d6fd/b3ad7f4b2b7b4f4fbbe7ce95762e5edc/FLAG7fe0fe7d7 [2021-12-06 21:06:40,128 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:06:40,129 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2021-12-06 21:06:40,143 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/data/4be79d6fd/b3ad7f4b2b7b4f4fbbe7ce95762e5edc/FLAG7fe0fe7d7 [2021-12-06 21:06:40,155 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/data/4be79d6fd/b3ad7f4b2b7b4f4fbbe7ce95762e5edc [2021-12-06 21:06:40,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:06:40,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:06:40,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:06:40,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:06:40,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:06:40,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e71d4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40, skipping insertion in model container [2021-12-06 21:06:40,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:06:40,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:06:40,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:06:40,614 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:06:40,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:06:40,724 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:06:40,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40 WrapperNode [2021-12-06 21:06:40,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:06:40,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:06:40,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:06:40,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:06:40,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,788 INFO L137 Inliner]: procedures = 368, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 184 [2021-12-06 21:06:40,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:06:40,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:06:40,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:06:40,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:06:40,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:06:40,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:06:40,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:06:40,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:06:40,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (1/1) ... [2021-12-06 21:06:40,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:06:40,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:06:40,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:06:40,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:06:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 21:06:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 21:06:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:06:40,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 21:06:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 21:06:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-12-06 21:06:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 21:06:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:06:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 21:06:40,910 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-12-06 21:06:40,910 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-12-06 21:06:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 21:06:40,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:06:40,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:06:40,913 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 21:06:41,020 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:06:41,022 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:06:41,354 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:06:41,362 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:06:41,362 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 21:06:41,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:06:41 BoogieIcfgContainer [2021-12-06 21:06:41,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:06:41,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:06:41,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:06:41,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:06:41,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:06:40" (1/3) ... [2021-12-06 21:06:41,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957d173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:06:41, skipping insertion in model container [2021-12-06 21:06:41,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:06:40" (2/3) ... [2021-12-06 21:06:41,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957d173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:06:41, skipping insertion in model container [2021-12-06 21:06:41,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:06:41" (3/3) ... [2021-12-06 21:06:41,370 INFO L111 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2021-12-06 21:06:41,374 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 21:06:41,374 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:06:41,374 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-06 21:06:41,374 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 21:06:41,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,417 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,417 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,417 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,418 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,418 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,418 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,419 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,420 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,421 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,422 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,423 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,424 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,425 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,426 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,427 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,428 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,429 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,430 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,431 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,432 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,433 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,434 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,435 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,436 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,437 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,438 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,439 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,440 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,441 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,442 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,443 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,445 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,445 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem38.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,446 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 21:06:41,449 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 21:06:41,483 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:06:41,489 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-12-06 21:06:41,489 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2021-12-06 21:06:41,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 290 places, 286 transitions, 577 flow [2021-12-06 21:06:41,566 INFO L129 PetriNetUnfolder]: 0/285 cut-off events. [2021-12-06 21:06:41,566 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 21:06:41,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 285 events. 0/285 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 155 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-12-06 21:06:41,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 286 transitions, 577 flow [2021-12-06 21:06:41,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 285 transitions, 573 flow [2021-12-06 21:06:41,580 INFO L129 PetriNetUnfolder]: 0/49 cut-off events. [2021-12-06 21:06:41,580 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 21:06:41,580 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:41,581 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] [2021-12-06 21:06:41,581 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-12-06 21:06:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:41,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2019786680, now seen corresponding path program 1 times [2021-12-06 21:06:41,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:41,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130187933] [2021-12-06 21:06:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:41,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:41,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130187933] [2021-12-06 21:06:41,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130187933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:41,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:41,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:41,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515079452] [2021-12-06 21:06:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:41,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:41,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:41,877 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 286 [2021-12-06 21:06:41,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 285 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 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-12-06 21:06:41,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:41,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 286 [2021-12-06 21:06:41,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:42,581 INFO L129 PetriNetUnfolder]: 864/2845 cut-off events. [2021-12-06 21:06:42,582 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-12-06 21:06:42,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4702 conditions, 2845 events. 864/2845 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 17958 event pairs, 864 based on Foata normal form. 0/2484 useless extension candidates. Maximal degree in co-relation 4476. Up to 1838 conditions per place. [2021-12-06 21:06:42,601 INFO L132 encePairwiseOnDemand]: 268/286 looper letters, 109 selfloop transitions, 15 changer transitions 0/282 dead transitions. [2021-12-06 21:06:42,601 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 282 transitions, 815 flow [2021-12-06 21:06:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1081 transitions. [2021-12-06 21:06:42,621 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.62995337995338 [2021-12-06 21:06:42,622 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1081 transitions. [2021-12-06 21:06:42,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1081 transitions. [2021-12-06 21:06:42,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:42,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1081 transitions. [2021-12-06 21:06:42,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.16666666666666) internal successors, (1081), 6 states have internal predecessors, (1081), 0 states have call successors, (0), 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-12-06 21:06:42,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:42,644 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:42,645 INFO L186 Difference]: Start difference. First operand has 289 places, 285 transitions, 573 flow. Second operand 6 states and 1081 transitions. [2021-12-06 21:06:42,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 282 transitions, 815 flow [2021-12-06 21:06:42,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 282 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 21:06:42,656 INFO L242 Difference]: Finished difference. Result has 290 places, 282 transitions, 596 flow [2021-12-06 21:06:42,658 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=596, PETRI_PLACES=290, PETRI_TRANSITIONS=282} [2021-12-06 21:06:42,660 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 1 predicate places. [2021-12-06 21:06:42,661 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 282 transitions, 596 flow [2021-12-06 21:06:42,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 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-12-06 21:06:42,662 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:42,662 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-12-06 21:06:42,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 21:06:42,662 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-12-06 21:06:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash 433367205, now seen corresponding path program 1 times [2021-12-06 21:06:42,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:42,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419083667] [2021-12-06 21:06:42,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:42,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:42,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:42,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419083667] [2021-12-06 21:06:42,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419083667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:42,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:42,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:42,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119153954] [2021-12-06 21:06:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:42,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:42,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:42,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:42,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:42,779 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 286 [2021-12-06 21:06:42,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 282 transitions, 596 flow. Second operand has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 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-12-06 21:06:42,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:42,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 286 [2021-12-06 21:06:42,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:43,297 INFO L129 PetriNetUnfolder]: 864/2842 cut-off events. [2021-12-06 21:06:43,297 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-06 21:06:43,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4711 conditions, 2842 events. 864/2842 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 17891 event pairs, 864 based on Foata normal form. 0/2484 useless extension candidates. Maximal degree in co-relation 4518. Up to 1835 conditions per place. [2021-12-06 21:06:43,311 INFO L132 encePairwiseOnDemand]: 268/286 looper letters, 106 selfloop transitions, 15 changer transitions 0/279 dead transitions. [2021-12-06 21:06:43,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 279 transitions, 832 flow [2021-12-06 21:06:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1078 transitions. [2021-12-06 21:06:43,316 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2021-12-06 21:06:43,316 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1078 transitions. [2021-12-06 21:06:43,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1078 transitions. [2021-12-06 21:06:43,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:43,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1078 transitions. [2021-12-06 21:06:43,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 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-12-06 21:06:43,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:43,327 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:43,327 INFO L186 Difference]: Start difference. First operand has 290 places, 282 transitions, 596 flow. Second operand 6 states and 1078 transitions. [2021-12-06 21:06:43,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 279 transitions, 832 flow [2021-12-06 21:06:43,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 279 transitions, 802 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 21:06:43,335 INFO L242 Difference]: Finished difference. Result has 287 places, 279 transitions, 590 flow [2021-12-06 21:06:43,336 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=287, PETRI_TRANSITIONS=279} [2021-12-06 21:06:43,336 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -2 predicate places. [2021-12-06 21:06:43,337 INFO L470 AbstractCegarLoop]: Abstraction has has 287 places, 279 transitions, 590 flow [2021-12-06 21:06:43,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 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-12-06 21:06:43,337 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:43,337 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] [2021-12-06 21:06:43,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 21:06:43,338 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-12-06 21:06:43,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1886336480, now seen corresponding path program 1 times [2021-12-06 21:06:43,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:43,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050363257] [2021-12-06 21:06:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:43,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:43,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:43,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050363257] [2021-12-06 21:06:43,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050363257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:43,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:43,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:06:43,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953149960] [2021-12-06 21:06:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:43,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:06:43,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:43,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:06:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:06:43,390 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 286 [2021-12-06 21:06:43,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 279 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 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-12-06 21:06:43,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:43,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 286 [2021-12-06 21:06:43,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:43,477 INFO L129 PetriNetUnfolder]: 9/506 cut-off events. [2021-12-06 21:06:43,477 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 21:06:43,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 506 events. 9/506 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1509 event pairs, 9 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 397. Up to 35 conditions per place. [2021-12-06 21:06:43,479 INFO L132 encePairwiseOnDemand]: 283/286 looper letters, 16 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2021-12-06 21:06:43,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 278 transitions, 624 flow [2021-12-06 21:06:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:06:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 21:06:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2021-12-06 21:06:43,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9557109557109557 [2021-12-06 21:06:43,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 820 transitions. [2021-12-06 21:06:43,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 820 transitions. [2021-12-06 21:06:43,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:43,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 820 transitions. [2021-12-06 21:06:43,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-12-06 21:06:43,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:43,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:43,487 INFO L186 Difference]: Start difference. First operand has 287 places, 279 transitions, 590 flow. Second operand 3 states and 820 transitions. [2021-12-06 21:06:43,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 278 transitions, 624 flow [2021-12-06 21:06:43,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 278 transitions, 594 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 21:06:43,492 INFO L242 Difference]: Finished difference. Result has 283 places, 278 transitions, 562 flow [2021-12-06 21:06:43,493 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=283, PETRI_TRANSITIONS=278} [2021-12-06 21:06:43,493 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -6 predicate places. [2021-12-06 21:06:43,493 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 278 transitions, 562 flow [2021-12-06 21:06:43,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 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-12-06 21:06:43,494 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:43,494 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] [2021-12-06 21:06:43,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 21:06:43,494 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-12-06 21:06:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1758764611, now seen corresponding path program 1 times [2021-12-06 21:06:43,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:43,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429225074] [2021-12-06 21:06:43,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:43,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:43,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429225074] [2021-12-06 21:06:43,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429225074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:43,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:43,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:06:43,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065651073] [2021-12-06 21:06:43,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:43,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:06:43,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:43,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:06:43,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:06:43,539 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2021-12-06 21:06:43,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 278 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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-12-06 21:06:43,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:43,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2021-12-06 21:06:43,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:43,582 INFO L129 PetriNetUnfolder]: 4/443 cut-off events. [2021-12-06 21:06:43,582 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-12-06 21:06:43,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 443 events. 4/443 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1090 event pairs, 4 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 395. Up to 17 conditions per place. [2021-12-06 21:06:43,584 INFO L132 encePairwiseOnDemand]: 281/286 looper letters, 10 selfloop transitions, 1 changer transitions 0/274 dead transitions. [2021-12-06 21:06:43,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 274 transitions, 576 flow [2021-12-06 21:06:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:06:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 21:06:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2021-12-06 21:06:43,586 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2021-12-06 21:06:43,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2021-12-06 21:06:43,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2021-12-06 21:06:43,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:43,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2021-12-06 21:06:43,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 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-12-06 21:06:43,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:43,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:43,592 INFO L186 Difference]: Start difference. First operand has 283 places, 278 transitions, 562 flow. Second operand 3 states and 825 transitions. [2021-12-06 21:06:43,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 274 transitions, 576 flow [2021-12-06 21:06:43,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 274 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 21:06:43,596 INFO L242 Difference]: Finished difference. Result has 279 places, 274 transitions, 552 flow [2021-12-06 21:06:43,597 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=279, PETRI_TRANSITIONS=274} [2021-12-06 21:06:43,597 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -10 predicate places. [2021-12-06 21:06:43,598 INFO L470 AbstractCegarLoop]: Abstraction has has 279 places, 274 transitions, 552 flow [2021-12-06 21:06:43,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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-12-06 21:06:43,598 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:43,598 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] [2021-12-06 21:06:43,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 21:06:43,599 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-12-06 21:06:43,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 894955619, now seen corresponding path program 1 times [2021-12-06 21:06:43,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:43,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072458560] [2021-12-06 21:06:43,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:43,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:43,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:43,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072458560] [2021-12-06 21:06:43,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072458560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:43,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:43,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:43,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606518101] [2021-12-06 21:06:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:43,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:43,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:43,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:43,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:43,723 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 286 [2021-12-06 21:06:43,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 274 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 173.16666666666666) internal successors, (1039), 6 states have internal predecessors, (1039), 0 states have call successors, (0), 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-12-06 21:06:43,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:43,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 286 [2021-12-06 21:06:43,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:44,213 INFO L129 PetriNetUnfolder]: 925/3008 cut-off events. [2021-12-06 21:06:44,213 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 21:06:44,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 3008 events. 925/3008 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 18994 event pairs, 925 based on Foata normal form. 0/2644 useless extension candidates. Maximal degree in co-relation 4890. Up to 1957 conditions per place. [2021-12-06 21:06:44,227 INFO L132 encePairwiseOnDemand]: 280/286 looper letters, 106 selfloop transitions, 5 changer transitions 0/273 dead transitions. [2021-12-06 21:06:44,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 273 transitions, 772 flow [2021-12-06 21:06:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1120 transitions. [2021-12-06 21:06:44,230 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6526806526806527 [2021-12-06 21:06:44,230 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1120 transitions. [2021-12-06 21:06:44,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1120 transitions. [2021-12-06 21:06:44,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:44,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1120 transitions. [2021-12-06 21:06:44,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.66666666666666) internal successors, (1120), 6 states have internal predecessors, (1120), 0 states have call successors, (0), 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-12-06 21:06:44,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:44,237 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:44,237 INFO L186 Difference]: Start difference. First operand has 279 places, 274 transitions, 552 flow. Second operand 6 states and 1120 transitions. [2021-12-06 21:06:44,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 273 transitions, 772 flow [2021-12-06 21:06:44,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 273 transitions, 771 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 21:06:44,242 INFO L242 Difference]: Finished difference. Result has 282 places, 273 transitions, 559 flow [2021-12-06 21:06:44,242 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=559, PETRI_PLACES=282, PETRI_TRANSITIONS=273} [2021-12-06 21:06:44,243 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -7 predicate places. [2021-12-06 21:06:44,243 INFO L470 AbstractCegarLoop]: Abstraction has has 282 places, 273 transitions, 559 flow [2021-12-06 21:06:44,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.16666666666666) internal successors, (1039), 6 states have internal predecessors, (1039), 0 states have call successors, (0), 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-12-06 21:06:44,244 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:44,244 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] [2021-12-06 21:06:44,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 21:06:44,244 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-12-06 21:06:44,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1539731552, now seen corresponding path program 1 times [2021-12-06 21:06:44,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:44,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435148921] [2021-12-06 21:06:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:44,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:44,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:44,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435148921] [2021-12-06 21:06:44,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435148921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:44,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:44,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:06:44,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160990895] [2021-12-06 21:06:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:44,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:06:44,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:06:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:06:44,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 286 [2021-12-06 21:06:44,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 273 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 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-12-06 21:06:44,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:44,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 286 [2021-12-06 21:06:44,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:44,343 INFO L129 PetriNetUnfolder]: 9/405 cut-off events. [2021-12-06 21:06:44,343 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 21:06:44,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 405 events. 9/405 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 786 event pairs, 9 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 379. Up to 35 conditions per place. [2021-12-06 21:06:44,345 INFO L132 encePairwiseOnDemand]: 283/286 looper letters, 16 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2021-12-06 21:06:44,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 272 transitions, 593 flow [2021-12-06 21:06:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:06:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 21:06:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2021-12-06 21:06:44,347 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9557109557109557 [2021-12-06 21:06:44,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 820 transitions. [2021-12-06 21:06:44,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 820 transitions. [2021-12-06 21:06:44,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:44,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 820 transitions. [2021-12-06 21:06:44,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 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-12-06 21:06:44,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:44,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:44,351 INFO L186 Difference]: Start difference. First operand has 282 places, 273 transitions, 559 flow. Second operand 3 states and 820 transitions. [2021-12-06 21:06:44,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 272 transitions, 593 flow [2021-12-06 21:06:44,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 272 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 21:06:44,356 INFO L242 Difference]: Finished difference. Result has 278 places, 272 transitions, 551 flow [2021-12-06 21:06:44,356 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=551, PETRI_PLACES=278, PETRI_TRANSITIONS=272} [2021-12-06 21:06:44,357 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -11 predicate places. [2021-12-06 21:06:44,357 INFO L470 AbstractCegarLoop]: Abstraction has has 278 places, 272 transitions, 551 flow [2021-12-06 21:06:44,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.3333333333333) internal successors, (805), 3 states have internal predecessors, (805), 0 states have call successors, (0), 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-12-06 21:06:44,357 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:44,358 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] [2021-12-06 21:06:44,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 21:06:44,358 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-12-06 21:06:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash -930597695, now seen corresponding path program 1 times [2021-12-06 21:06:44,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:44,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051900094] [2021-12-06 21:06:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:44,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:44,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:44,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051900094] [2021-12-06 21:06:44,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051900094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:44,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:44,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 21:06:44,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198776173] [2021-12-06 21:06:44,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:44,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:06:44,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:44,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:06:44,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:06:44,415 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2021-12-06 21:06:44,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 272 transitions, 551 flow. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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-12-06 21:06:44,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:44,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2021-12-06 21:06:44,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:44,477 INFO L129 PetriNetUnfolder]: 4/361 cut-off events. [2021-12-06 21:06:44,478 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-12-06 21:06:44,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 361 events. 4/361 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 525 event pairs, 4 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 316. Up to 17 conditions per place. [2021-12-06 21:06:44,480 INFO L132 encePairwiseOnDemand]: 281/286 looper letters, 10 selfloop transitions, 1 changer transitions 0/268 dead transitions. [2021-12-06 21:06:44,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 268 transitions, 565 flow [2021-12-06 21:06:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:06:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 21:06:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 825 transitions. [2021-12-06 21:06:44,483 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2021-12-06 21:06:44,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 825 transitions. [2021-12-06 21:06:44,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 825 transitions. [2021-12-06 21:06:44,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:44,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 825 transitions. [2021-12-06 21:06:44,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 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-12-06 21:06:44,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:44,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:44,490 INFO L186 Difference]: Start difference. First operand has 278 places, 272 transitions, 551 flow. Second operand 3 states and 825 transitions. [2021-12-06 21:06:44,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 268 transitions, 565 flow [2021-12-06 21:06:44,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 268 transitions, 561 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 21:06:44,498 INFO L242 Difference]: Finished difference. Result has 274 places, 268 transitions, 541 flow [2021-12-06 21:06:44,498 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=274, PETRI_TRANSITIONS=268} [2021-12-06 21:06:44,499 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -15 predicate places. [2021-12-06 21:06:44,499 INFO L470 AbstractCegarLoop]: Abstraction has has 274 places, 268 transitions, 541 flow [2021-12-06 21:06:44,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 0 states have call successors, (0), 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-12-06 21:06:44,500 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:44,500 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] [2021-12-06 21:06:44,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 21:06:44,500 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-12-06 21:06:44,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1661222507, now seen corresponding path program 1 times [2021-12-06 21:06:44,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:44,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193611303] [2021-12-06 21:06:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:44,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:44,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:44,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193611303] [2021-12-06 21:06:44,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193611303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:44,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:44,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:44,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512104228] [2021-12-06 21:06:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:44,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:44,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:44,639 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 286 [2021-12-06 21:06:44,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 268 transitions, 541 flow. Second operand has 6 states, 6 states have (on average 175.66666666666666) internal successors, (1054), 6 states have internal predecessors, (1054), 0 states have call successors, (0), 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-12-06 21:06:44,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:44,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 286 [2021-12-06 21:06:44,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:45,125 INFO L129 PetriNetUnfolder]: 925/2919 cut-off events. [2021-12-06 21:06:45,126 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 21:06:45,129 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4886 conditions, 2919 events. 925/2919 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 18218 event pairs, 925 based on Foata normal form. 0/2589 useless extension candidates. Maximal degree in co-relation 4802. Up to 1956 conditions per place. [2021-12-06 21:06:45,138 INFO L132 encePairwiseOnDemand]: 280/286 looper letters, 105 selfloop transitions, 5 changer transitions 0/267 dead transitions. [2021-12-06 21:06:45,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 267 transitions, 759 flow [2021-12-06 21:06:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1119 transitions. [2021-12-06 21:06:45,142 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6520979020979021 [2021-12-06 21:06:45,142 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1119 transitions. [2021-12-06 21:06:45,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1119 transitions. [2021-12-06 21:06:45,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:45,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1119 transitions. [2021-12-06 21:06:45,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.5) internal successors, (1119), 6 states have internal predecessors, (1119), 0 states have call successors, (0), 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-12-06 21:06:45,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:45,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:45,148 INFO L186 Difference]: Start difference. First operand has 274 places, 268 transitions, 541 flow. Second operand 6 states and 1119 transitions. [2021-12-06 21:06:45,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 267 transitions, 759 flow [2021-12-06 21:06:45,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 267 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 21:06:45,152 INFO L242 Difference]: Finished difference. Result has 277 places, 267 transitions, 548 flow [2021-12-06 21:06:45,152 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=277, PETRI_TRANSITIONS=267} [2021-12-06 21:06:45,153 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -12 predicate places. [2021-12-06 21:06:45,153 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 267 transitions, 548 flow [2021-12-06 21:06:45,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.66666666666666) internal successors, (1054), 6 states have internal predecessors, (1054), 0 states have call successors, (0), 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-12-06 21:06:45,153 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:45,154 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] [2021-12-06 21:06:45,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 21:06:45,154 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-12-06 21:06:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:45,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1597179399, now seen corresponding path program 1 times [2021-12-06 21:06:45,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:45,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789987134] [2021-12-06 21:06:45,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:45,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:45,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:45,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789987134] [2021-12-06 21:06:45,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789987134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:45,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:45,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:45,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177851478] [2021-12-06 21:06:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:45,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:45,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:45,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:45,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 286 [2021-12-06 21:06:45,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 267 transitions, 548 flow. Second operand has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 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-12-06 21:06:45,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:45,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 286 [2021-12-06 21:06:45,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:46,039 INFO L129 PetriNetUnfolder]: 1392/4456 cut-off events. [2021-12-06 21:06:46,039 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-12-06 21:06:46,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7405 conditions, 4456 events. 1392/4456 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 32499 event pairs, 181 based on Foata normal form. 0/4010 useless extension candidates. Maximal degree in co-relation 7321. Up to 1396 conditions per place. [2021-12-06 21:06:46,058 INFO L132 encePairwiseOnDemand]: 267/286 looper letters, 210 selfloop transitions, 38 changer transitions 0/408 dead transitions. [2021-12-06 21:06:46,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 408 transitions, 1326 flow [2021-12-06 21:06:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1276 transitions. [2021-12-06 21:06:46,061 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2021-12-06 21:06:46,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1276 transitions. [2021-12-06 21:06:46,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1276 transitions. [2021-12-06 21:06:46,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:46,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1276 transitions. [2021-12-06 21:06:46,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 212.66666666666666) internal successors, (1276), 6 states have internal predecessors, (1276), 0 states have call successors, (0), 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-12-06 21:06:46,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:46,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:46,067 INFO L186 Difference]: Start difference. First operand has 277 places, 267 transitions, 548 flow. Second operand 6 states and 1276 transitions. [2021-12-06 21:06:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 408 transitions, 1326 flow [2021-12-06 21:06:46,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 408 transitions, 1316 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 21:06:46,074 INFO L242 Difference]: Finished difference. Result has 281 places, 303 transitions, 796 flow [2021-12-06 21:06:46,075 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=281, PETRI_TRANSITIONS=303} [2021-12-06 21:06:46,076 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -8 predicate places. [2021-12-06 21:06:46,076 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 303 transitions, 796 flow [2021-12-06 21:06:46,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 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-12-06 21:06:46,076 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:46,076 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] [2021-12-06 21:06:46,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 21:06:46,077 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-12-06 21:06:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:46,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2099699453, now seen corresponding path program 1 times [2021-12-06 21:06:46,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:46,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531610802] [2021-12-06 21:06:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:46,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:46,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:46,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531610802] [2021-12-06 21:06:46,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531610802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:46,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:46,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:46,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417969114] [2021-12-06 21:06:46,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:46,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:46,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:46,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:46,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:46,181 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 286 [2021-12-06 21:06:46,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 303 transitions, 796 flow. Second operand has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 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-12-06 21:06:46,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:46,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 286 [2021-12-06 21:06:46,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:47,019 INFO L129 PetriNetUnfolder]: 1425/4498 cut-off events. [2021-12-06 21:06:47,019 INFO L130 PetriNetUnfolder]: For 1087/1090 co-relation queries the response was YES. [2021-12-06 21:06:47,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8620 conditions, 4498 events. 1425/4498 cut-off events. For 1087/1090 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32457 event pairs, 1015 based on Foata normal form. 0/4071 useless extension candidates. Maximal degree in co-relation 8534. Up to 2720 conditions per place. [2021-12-06 21:06:47,042 INFO L132 encePairwiseOnDemand]: 280/286 looper letters, 227 selfloop transitions, 5 changer transitions 0/394 dead transitions. [2021-12-06 21:06:47,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 394 transitions, 1482 flow [2021-12-06 21:06:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1234 transitions. [2021-12-06 21:06:47,045 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7191142191142191 [2021-12-06 21:06:47,045 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1234 transitions. [2021-12-06 21:06:47,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1234 transitions. [2021-12-06 21:06:47,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:47,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1234 transitions. [2021-12-06 21:06:47,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 205.66666666666666) internal successors, (1234), 6 states have internal predecessors, (1234), 0 states have call successors, (0), 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-12-06 21:06:47,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:47,052 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:47,052 INFO L186 Difference]: Start difference. First operand has 281 places, 303 transitions, 796 flow. Second operand 6 states and 1234 transitions. [2021-12-06 21:06:47,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 394 transitions, 1482 flow [2021-12-06 21:06:47,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 394 transitions, 1482 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 21:06:47,061 INFO L242 Difference]: Finished difference. Result has 285 places, 302 transitions, 804 flow [2021-12-06 21:06:47,062 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=285, PETRI_TRANSITIONS=302} [2021-12-06 21:06:47,062 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, -4 predicate places. [2021-12-06 21:06:47,063 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 302 transitions, 804 flow [2021-12-06 21:06:47,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 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-12-06 21:06:47,063 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:47,063 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] [2021-12-06 21:06:47,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 21:06:47,064 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-12-06 21:06:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 449131661, now seen corresponding path program 1 times [2021-12-06 21:06:47,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:47,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880691720] [2021-12-06 21:06:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:47,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:47,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:47,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880691720] [2021-12-06 21:06:47,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880691720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:47,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:47,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:47,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086378690] [2021-12-06 21:06:47,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:47,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:47,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:47,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:47,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:47,164 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 286 [2021-12-06 21:06:47,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 302 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 177.66666666666666) internal successors, (1066), 6 states have internal predecessors, (1066), 0 states have call successors, (0), 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-12-06 21:06:47,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:47,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 286 [2021-12-06 21:06:47,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:48,211 INFO L129 PetriNetUnfolder]: 1814/5628 cut-off events. [2021-12-06 21:06:48,211 INFO L130 PetriNetUnfolder]: For 1369/1375 co-relation queries the response was YES. [2021-12-06 21:06:48,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10851 conditions, 5628 events. 1814/5628 cut-off events. For 1369/1375 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 43453 event pairs, 427 based on Foata normal form. 0/5194 useless extension candidates. Maximal degree in co-relation 10761. Up to 2162 conditions per place. [2021-12-06 21:06:48,234 INFO L132 encePairwiseOnDemand]: 265/286 looper letters, 253 selfloop transitions, 71 changer transitions 0/481 dead transitions. [2021-12-06 21:06:48,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 481 transitions, 2066 flow [2021-12-06 21:06:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1269 transitions. [2021-12-06 21:06:48,237 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7395104895104895 [2021-12-06 21:06:48,237 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1269 transitions. [2021-12-06 21:06:48,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1269 transitions. [2021-12-06 21:06:48,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:48,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1269 transitions. [2021-12-06 21:06:48,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 0 states have call successors, (0), 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-12-06 21:06:48,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:48,244 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:48,244 INFO L186 Difference]: Start difference. First operand has 285 places, 302 transitions, 804 flow. Second operand 6 states and 1269 transitions. [2021-12-06 21:06:48,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 481 transitions, 2066 flow [2021-12-06 21:06:48,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 481 transitions, 2016 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 21:06:48,256 INFO L242 Difference]: Finished difference. Result has 290 places, 371 transitions, 1452 flow [2021-12-06 21:06:48,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1452, PETRI_PLACES=290, PETRI_TRANSITIONS=371} [2021-12-06 21:06:48,257 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 1 predicate places. [2021-12-06 21:06:48,257 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 371 transitions, 1452 flow [2021-12-06 21:06:48,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.66666666666666) internal successors, (1066), 6 states have internal predecessors, (1066), 0 states have call successors, (0), 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-12-06 21:06:48,257 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:48,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] [2021-12-06 21:06:48,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 21:06:48,258 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-12-06 21:06:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash 544060034, now seen corresponding path program 1 times [2021-12-06 21:06:48,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:48,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585314786] [2021-12-06 21:06:48,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:48,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:48,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:48,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:48,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585314786] [2021-12-06 21:06:48,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585314786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:48,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:48,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:48,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330695008] [2021-12-06 21:06:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:48,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:48,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:48,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:48,360 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 286 [2021-12-06 21:06:48,362 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 371 transitions, 1452 flow. Second operand has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 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-12-06 21:06:48,362 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:48,362 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 286 [2021-12-06 21:06:48,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:49,286 INFO L129 PetriNetUnfolder]: 1933/6129 cut-off events. [2021-12-06 21:06:49,286 INFO L130 PetriNetUnfolder]: For 3618/3665 co-relation queries the response was YES. [2021-12-06 21:06:49,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14053 conditions, 6129 events. 1933/6129 cut-off events. For 3618/3665 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 47976 event pairs, 1000 based on Foata normal form. 0/5716 useless extension candidates. Maximal degree in co-relation 13962. Up to 3830 conditions per place. [2021-12-06 21:06:49,311 INFO L132 encePairwiseOnDemand]: 263/286 looper letters, 240 selfloop transitions, 89 changer transitions 0/490 dead transitions. [2021-12-06 21:06:49,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 490 transitions, 2630 flow [2021-12-06 21:06:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2021-12-06 21:06:49,314 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7185314685314685 [2021-12-06 21:06:49,314 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1233 transitions. [2021-12-06 21:06:49,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1233 transitions. [2021-12-06 21:06:49,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:49,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1233 transitions. [2021-12-06 21:06:49,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 205.5) internal successors, (1233), 6 states have internal predecessors, (1233), 0 states have call successors, (0), 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-12-06 21:06:49,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:49,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:49,319 INFO L186 Difference]: Start difference. First operand has 290 places, 371 transitions, 1452 flow. Second operand 6 states and 1233 transitions. [2021-12-06 21:06:49,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 490 transitions, 2630 flow [2021-12-06 21:06:49,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 490 transitions, 2630 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-06 21:06:49,334 INFO L242 Difference]: Finished difference. Result has 300 places, 455 transitions, 2254 flow [2021-12-06 21:06:49,334 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2254, PETRI_PLACES=300, PETRI_TRANSITIONS=455} [2021-12-06 21:06:49,335 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 11 predicate places. [2021-12-06 21:06:49,335 INFO L470 AbstractCegarLoop]: Abstraction has has 300 places, 455 transitions, 2254 flow [2021-12-06 21:06:49,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 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-12-06 21:06:49,335 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:49,335 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] [2021-12-06 21:06:49,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 21:06:49,336 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-12-06 21:06:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:49,336 INFO L85 PathProgramCache]: Analyzing trace with hash -345252745, now seen corresponding path program 1 times [2021-12-06 21:06:49,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:49,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736763211] [2021-12-06 21:06:49,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:49,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:49,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-12-06 21:06:49,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:49,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736763211] [2021-12-06 21:06:49,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736763211] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:49,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:49,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:06:49,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692571957] [2021-12-06 21:06:49,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:49,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:06:49,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:06:49,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:06:49,399 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 286 [2021-12-06 21:06:49,400 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 455 transitions, 2254 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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-12-06 21:06:49,400 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:49,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 286 [2021-12-06 21:06:49,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:49,654 INFO L129 PetriNetUnfolder]: 274/1903 cut-off events. [2021-12-06 21:06:49,654 INFO L130 PetriNetUnfolder]: For 1031/1094 co-relation queries the response was YES. [2021-12-06 21:06:49,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 1903 events. 274/1903 cut-off events. For 1031/1094 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13040 event pairs, 25 based on Foata normal form. 4/1827 useless extension candidates. Maximal degree in co-relation 3798. Up to 272 conditions per place. [2021-12-06 21:06:49,663 INFO L132 encePairwiseOnDemand]: 280/286 looper letters, 15 selfloop transitions, 6 changer transitions 0/395 dead transitions. [2021-12-06 21:06:49,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 395 transitions, 1732 flow [2021-12-06 21:06:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:06:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 21:06:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2021-12-06 21:06:49,665 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9743589743589743 [2021-12-06 21:06:49,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 836 transitions. [2021-12-06 21:06:49,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 836 transitions. [2021-12-06 21:06:49,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:49,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 836 transitions. [2021-12-06 21:06:49,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 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-12-06 21:06:49,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:49,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 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-12-06 21:06:49,668 INFO L186 Difference]: Start difference. First operand has 300 places, 455 transitions, 2254 flow. Second operand 3 states and 836 transitions. [2021-12-06 21:06:49,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 395 transitions, 1732 flow [2021-12-06 21:06:49,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 395 transitions, 1644 flow, removed 44 selfloop flow, removed 0 redundant places. [2021-12-06 21:06:49,681 INFO L242 Difference]: Finished difference. Result has 303 places, 393 transitions, 1624 flow [2021-12-06 21:06:49,682 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1624, PETRI_PLACES=303, PETRI_TRANSITIONS=393} [2021-12-06 21:06:49,683 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 14 predicate places. [2021-12-06 21:06:49,683 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 393 transitions, 1624 flow [2021-12-06 21:06:49,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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-12-06 21:06:49,683 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:49,683 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] [2021-12-06 21:06:49,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 21:06:49,683 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-12-06 21:06:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash 654097040, now seen corresponding path program 1 times [2021-12-06 21:06:49,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:49,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359636359] [2021-12-06 21:06:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:49,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:49,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:49,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359636359] [2021-12-06 21:06:49,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359636359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:49,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:49,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:49,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480843450] [2021-12-06 21:06:49,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:49,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:49,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:49,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:49,780 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 286 [2021-12-06 21:06:49,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 393 transitions, 1624 flow. Second operand has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 0 states have call successors, (0), 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-12-06 21:06:49,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:49,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 286 [2021-12-06 21:06:49,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:50,818 INFO L129 PetriNetUnfolder]: 1230/4300 cut-off events. [2021-12-06 21:06:50,818 INFO L130 PetriNetUnfolder]: For 3311/3340 co-relation queries the response was YES. [2021-12-06 21:06:50,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10867 conditions, 4300 events. 1230/4300 cut-off events. For 3311/3340 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 33116 event pairs, 209 based on Foata normal form. 0/4126 useless extension candidates. Maximal degree in co-relation 10768. Up to 1159 conditions per place. [2021-12-06 21:06:50,838 INFO L132 encePairwiseOnDemand]: 267/286 looper letters, 376 selfloop transitions, 124 changer transitions 4/669 dead transitions. [2021-12-06 21:06:50,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 669 transitions, 4198 flow [2021-12-06 21:06:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1321 transitions. [2021-12-06 21:06:50,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7698135198135199 [2021-12-06 21:06:50,841 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1321 transitions. [2021-12-06 21:06:50,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1321 transitions. [2021-12-06 21:06:50,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:50,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1321 transitions. [2021-12-06 21:06:50,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.16666666666666) internal successors, (1321), 6 states have internal predecessors, (1321), 0 states have call successors, (0), 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-12-06 21:06:50,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:50,846 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:50,846 INFO L186 Difference]: Start difference. First operand has 303 places, 393 transitions, 1624 flow. Second operand 6 states and 1321 transitions. [2021-12-06 21:06:50,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 669 transitions, 4198 flow [2021-12-06 21:06:50,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 669 transitions, 4192 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-06 21:06:50,867 INFO L242 Difference]: Finished difference. Result has 311 places, 495 transitions, 3000 flow [2021-12-06 21:06:50,868 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3000, PETRI_PLACES=311, PETRI_TRANSITIONS=495} [2021-12-06 21:06:50,868 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 22 predicate places. [2021-12-06 21:06:50,868 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 495 transitions, 3000 flow [2021-12-06 21:06:50,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 0 states have call successors, (0), 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-12-06 21:06:50,869 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:50,869 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] [2021-12-06 21:06:50,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 21:06:50,869 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-12-06 21:06:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:50,869 INFO L85 PathProgramCache]: Analyzing trace with hash 859331813, now seen corresponding path program 1 times [2021-12-06 21:06:50,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:50,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000353241] [2021-12-06 21:06:50,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:50,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:50,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:50,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000353241] [2021-12-06 21:06:50,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000353241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:50,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:50,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:06:50,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134792195] [2021-12-06 21:06:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:50,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:06:50,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:50,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:06:50,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:06:50,960 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 286 [2021-12-06 21:06:50,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 495 transitions, 3000 flow. Second operand has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 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-12-06 21:06:50,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:50,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 286 [2021-12-06 21:06:50,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:52,011 INFO L129 PetriNetUnfolder]: 1281/4364 cut-off events. [2021-12-06 21:06:52,011 INFO L130 PetriNetUnfolder]: For 6065/6105 co-relation queries the response was YES. [2021-12-06 21:06:52,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12642 conditions, 4364 events. 1281/4364 cut-off events. For 6065/6105 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 33296 event pairs, 469 based on Foata normal form. 0/4236 useless extension candidates. Maximal degree in co-relation 12540. Up to 2346 conditions per place. [2021-12-06 21:06:52,032 INFO L132 encePairwiseOnDemand]: 280/286 looper letters, 410 selfloop transitions, 17 changer transitions 0/594 dead transitions. [2021-12-06 21:06:52,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 594 transitions, 4444 flow [2021-12-06 21:06:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:06:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:06:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2021-12-06 21:06:52,035 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7132867132867133 [2021-12-06 21:06:52,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1224 transitions. [2021-12-06 21:06:52,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1224 transitions. [2021-12-06 21:06:52,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:52,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1224 transitions. [2021-12-06 21:06:52,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 0 states have call successors, (0), 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-12-06 21:06:52,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:52,040 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:06:52,040 INFO L186 Difference]: Start difference. First operand has 311 places, 495 transitions, 3000 flow. Second operand 6 states and 1224 transitions. [2021-12-06 21:06:52,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 594 transitions, 4444 flow [2021-12-06 21:06:52,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 594 transitions, 4426 flow, removed 9 selfloop flow, removed 0 redundant places. [2021-12-06 21:06:52,063 INFO L242 Difference]: Finished difference. Result has 315 places, 494 transitions, 3014 flow [2021-12-06 21:06:52,064 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2980, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3014, PETRI_PLACES=315, PETRI_TRANSITIONS=494} [2021-12-06 21:06:52,065 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 26 predicate places. [2021-12-06 21:06:52,065 INFO L470 AbstractCegarLoop]: Abstraction has has 315 places, 494 transitions, 3014 flow [2021-12-06 21:06:52,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 184.33333333333334) internal successors, (1106), 6 states have internal predecessors, (1106), 0 states have call successors, (0), 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-12-06 21:06:52,065 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:52,065 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, 1, 1] [2021-12-06 21:06:52,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-06 21:06:52,065 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-12-06 21:06:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash 64130171, now seen corresponding path program 1 times [2021-12-06 21:06:52,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:52,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872194467] [2021-12-06 21:06:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:52,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:52,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:52,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872194467] [2021-12-06 21:06:52,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872194467] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:52,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:52,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-06 21:06:52,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397273470] [2021-12-06 21:06:52,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:52,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 21:06:52,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:52,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 21:06:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-12-06 21:06:52,520 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2021-12-06 21:06:52,522 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 494 transitions, 3014 flow. Second operand has 22 states, 22 states have (on average 128.13636363636363) internal successors, (2819), 22 states have internal predecessors, (2819), 0 states have call successors, (0), 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-12-06 21:06:52,522 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:52,522 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2021-12-06 21:06:52,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:54,524 INFO L129 PetriNetUnfolder]: 1855/5688 cut-off events. [2021-12-06 21:06:54,525 INFO L130 PetriNetUnfolder]: For 6907/6907 co-relation queries the response was YES. [2021-12-06 21:06:54,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16565 conditions, 5688 events. 1855/5688 cut-off events. For 6907/6907 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 44450 event pairs, 173 based on Foata normal form. 15/5566 useless extension candidates. Maximal degree in co-relation 16441. Up to 1995 conditions per place. [2021-12-06 21:06:54,552 INFO L132 encePairwiseOnDemand]: 254/286 looper letters, 551 selfloop transitions, 127 changer transitions 1/794 dead transitions. [2021-12-06 21:06:54,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 794 transitions, 6128 flow [2021-12-06 21:06:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 21:06:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-12-06 21:06:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5065 transitions. [2021-12-06 21:06:54,562 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4660471107839529 [2021-12-06 21:06:54,562 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5065 transitions. [2021-12-06 21:06:54,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5065 transitions. [2021-12-06 21:06:54,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:54,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5065 transitions. [2021-12-06 21:06:54,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 133.28947368421052) internal successors, (5065), 38 states have internal predecessors, (5065), 0 states have call successors, (0), 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-12-06 21:06:54,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 286.0) internal successors, (11154), 39 states have internal predecessors, (11154), 0 states have call successors, (0), 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-12-06 21:06:54,583 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 286.0) internal successors, (11154), 39 states have internal predecessors, (11154), 0 states have call successors, (0), 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-12-06 21:06:54,583 INFO L186 Difference]: Start difference. First operand has 315 places, 494 transitions, 3014 flow. Second operand 38 states and 5065 transitions. [2021-12-06 21:06:54,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 794 transitions, 6128 flow [2021-12-06 21:06:54,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 794 transitions, 6068 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-06 21:06:54,613 INFO L242 Difference]: Finished difference. Result has 362 places, 553 transitions, 3828 flow [2021-12-06 21:06:54,613 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2980, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=3828, PETRI_PLACES=362, PETRI_TRANSITIONS=553} [2021-12-06 21:06:54,614 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 73 predicate places. [2021-12-06 21:06:54,614 INFO L470 AbstractCegarLoop]: Abstraction has has 362 places, 553 transitions, 3828 flow [2021-12-06 21:06:54,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 128.13636363636363) internal successors, (2819), 22 states have internal predecessors, (2819), 0 states have call successors, (0), 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-12-06 21:06:54,614 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:54,614 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, 1, 1] [2021-12-06 21:06:54,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 21:06:54,615 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-12-06 21:06:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 247325162, now seen corresponding path program 1 times [2021-12-06 21:06:54,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:54,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183705908] [2021-12-06 21:06:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:54,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:55,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:55,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183705908] [2021-12-06 21:06:55,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183705908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:55,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:55,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-06 21:06:55,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977310733] [2021-12-06 21:06:55,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:55,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 21:06:55,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:55,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 21:06:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2021-12-06 21:06:55,080 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2021-12-06 21:06:55,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 553 transitions, 3828 flow. Second operand has 20 states, 20 states have (on average 131.55) internal successors, (2631), 20 states have internal predecessors, (2631), 0 states have call successors, (0), 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-12-06 21:06:55,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:55,082 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2021-12-06 21:06:55,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:06:57,732 INFO L129 PetriNetUnfolder]: 2214/6849 cut-off events. [2021-12-06 21:06:57,732 INFO L130 PetriNetUnfolder]: For 12908/12916 co-relation queries the response was YES. [2021-12-06 21:06:57,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22108 conditions, 6849 events. 2214/6849 cut-off events. For 12908/12916 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 56692 event pairs, 354 based on Foata normal form. 18/6712 useless extension candidates. Maximal degree in co-relation 21962. Up to 1702 conditions per place. [2021-12-06 21:06:57,768 INFO L132 encePairwiseOnDemand]: 252/286 looper letters, 712 selfloop transitions, 158 changer transitions 3/992 dead transitions. [2021-12-06 21:06:57,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 992 transitions, 8644 flow [2021-12-06 21:06:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-06 21:06:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-12-06 21:06:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4233 transitions. [2021-12-06 21:06:57,773 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.49335664335664337 [2021-12-06 21:06:57,774 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4233 transitions. [2021-12-06 21:06:57,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4233 transitions. [2021-12-06 21:06:57,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:06:57,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4233 transitions. [2021-12-06 21:06:57,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 141.1) internal successors, (4233), 30 states have internal predecessors, (4233), 0 states have call successors, (0), 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-12-06 21:06:57,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 286.0) internal successors, (8866), 31 states have internal predecessors, (8866), 0 states have call successors, (0), 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-12-06 21:06:57,787 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 286.0) internal successors, (8866), 31 states have internal predecessors, (8866), 0 states have call successors, (0), 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-12-06 21:06:57,787 INFO L186 Difference]: Start difference. First operand has 362 places, 553 transitions, 3828 flow. Second operand 30 states and 4233 transitions. [2021-12-06 21:06:57,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 992 transitions, 8644 flow [2021-12-06 21:06:57,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 992 transitions, 8509 flow, removed 53 selfloop flow, removed 11 redundant places. [2021-12-06 21:06:57,845 INFO L242 Difference]: Finished difference. Result has 390 places, 643 transitions, 5301 flow [2021-12-06 21:06:57,846 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=3746, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5301, PETRI_PLACES=390, PETRI_TRANSITIONS=643} [2021-12-06 21:06:57,846 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 101 predicate places. [2021-12-06 21:06:57,846 INFO L470 AbstractCegarLoop]: Abstraction has has 390 places, 643 transitions, 5301 flow [2021-12-06 21:06:57,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 131.55) internal successors, (2631), 20 states have internal predecessors, (2631), 0 states have call successors, (0), 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-12-06 21:06:57,847 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:06:57,847 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, 1, 1] [2021-12-06 21:06:57,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 21:06:57,847 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-12-06 21:06:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:06:57,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1698746698, now seen corresponding path program 2 times [2021-12-06 21:06:57,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:06:57,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798708883] [2021-12-06 21:06:57,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:06:57,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:06:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:06:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:06:58,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:06:58,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798708883] [2021-12-06 21:06:58,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798708883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:06:58,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:06:58,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-06 21:06:58,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539780627] [2021-12-06 21:06:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:06:58,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 21:06:58,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:06:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 21:06:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-12-06 21:06:58,249 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2021-12-06 21:06:58,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 643 transitions, 5301 flow. Second operand has 22 states, 22 states have (on average 130.0909090909091) internal successors, (2862), 22 states have internal predecessors, (2862), 0 states have call successors, (0), 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-12-06 21:06:58,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:06:58,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2021-12-06 21:06:58,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:01,224 INFO L129 PetriNetUnfolder]: 2335/7100 cut-off events. [2021-12-06 21:07:01,224 INFO L130 PetriNetUnfolder]: For 17637/17647 co-relation queries the response was YES. [2021-12-06 21:07:01,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24661 conditions, 7100 events. 2335/7100 cut-off events. For 17637/17647 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 58494 event pairs, 192 based on Foata normal form. 25/6975 useless extension candidates. Maximal degree in co-relation 24502. Up to 1290 conditions per place. [2021-12-06 21:07:01,277 INFO L132 encePairwiseOnDemand]: 253/286 looper letters, 688 selfloop transitions, 202 changer transitions 4/1011 dead transitions. [2021-12-06 21:07:01,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 1011 transitions, 9464 flow [2021-12-06 21:07:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 21:07:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-12-06 21:07:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5203 transitions. [2021-12-06 21:07:01,282 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47874493927125505 [2021-12-06 21:07:01,282 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5203 transitions. [2021-12-06 21:07:01,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5203 transitions. [2021-12-06 21:07:01,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:01,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5203 transitions. [2021-12-06 21:07:01,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 136.92105263157896) internal successors, (5203), 38 states have internal predecessors, (5203), 0 states have call successors, (0), 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-12-06 21:07:01,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 286.0) internal successors, (11154), 39 states have internal predecessors, (11154), 0 states have call successors, (0), 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-12-06 21:07:01,296 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 286.0) internal successors, (11154), 39 states have internal predecessors, (11154), 0 states have call successors, (0), 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-12-06 21:07:01,296 INFO L186 Difference]: Start difference. First operand has 390 places, 643 transitions, 5301 flow. Second operand 38 states and 5203 transitions. [2021-12-06 21:07:01,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 1011 transitions, 9464 flow [2021-12-06 21:07:01,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 1011 transitions, 9392 flow, removed 17 selfloop flow, removed 11 redundant places. [2021-12-06 21:07:01,395 INFO L242 Difference]: Finished difference. Result has 429 places, 706 transitions, 6484 flow [2021-12-06 21:07:01,396 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=5253, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=6484, PETRI_PLACES=429, PETRI_TRANSITIONS=706} [2021-12-06 21:07:01,396 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 140 predicate places. [2021-12-06 21:07:01,396 INFO L470 AbstractCegarLoop]: Abstraction has has 429 places, 706 transitions, 6484 flow [2021-12-06 21:07:01,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 130.0909090909091) internal successors, (2862), 22 states have internal predecessors, (2862), 0 states have call successors, (0), 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-12-06 21:07:01,397 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:01,397 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, 1, 1] [2021-12-06 21:07:01,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-06 21:07:01,397 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-12-06 21:07:01,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:01,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1660544022, now seen corresponding path program 3 times [2021-12-06 21:07:01,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:01,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994936558] [2021-12-06 21:07:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:01,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:01,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:01,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994936558] [2021-12-06 21:07:01,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994936558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:01,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:01,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-06 21:07:01,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137614716] [2021-12-06 21:07:01,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:01,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 21:07:01,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:01,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 21:07:01,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-12-06 21:07:01,910 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2021-12-06 21:07:01,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 706 transitions, 6484 flow. Second operand has 21 states, 21 states have (on average 130.33333333333334) internal successors, (2737), 21 states have internal predecessors, (2737), 0 states have call successors, (0), 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-12-06 21:07:01,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:01,913 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2021-12-06 21:07:01,913 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:05,652 INFO L129 PetriNetUnfolder]: 2817/8465 cut-off events. [2021-12-06 21:07:05,652 INFO L130 PetriNetUnfolder]: For 28019/28031 co-relation queries the response was YES. [2021-12-06 21:07:05,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32003 conditions, 8465 events. 2817/8465 cut-off events. For 28019/28031 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 73040 event pairs, 299 based on Foata normal form. 27/8329 useless extension candidates. Maximal degree in co-relation 31828. Up to 1418 conditions per place. [2021-12-06 21:07:05,721 INFO L132 encePairwiseOnDemand]: 249/286 looper letters, 855 selfloop transitions, 242 changer transitions 4/1218 dead transitions. [2021-12-06 21:07:05,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 1218 transitions, 12586 flow [2021-12-06 21:07:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-06 21:07:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-12-06 21:07:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4900 transitions. [2021-12-06 21:07:05,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.48951048951048953 [2021-12-06 21:07:05,726 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 4900 transitions. [2021-12-06 21:07:05,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 4900 transitions. [2021-12-06 21:07:05,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:05,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 4900 transitions. [2021-12-06 21:07:05,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 140.0) internal successors, (4900), 35 states have internal predecessors, (4900), 0 states have call successors, (0), 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-12-06 21:07:05,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 286.0) internal successors, (10296), 36 states have internal predecessors, (10296), 0 states have call successors, (0), 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-12-06 21:07:05,738 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 286.0) internal successors, (10296), 36 states have internal predecessors, (10296), 0 states have call successors, (0), 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-12-06 21:07:05,738 INFO L186 Difference]: Start difference. First operand has 429 places, 706 transitions, 6484 flow. Second operand 35 states and 4900 transitions. [2021-12-06 21:07:05,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 1218 transitions, 12586 flow [2021-12-06 21:07:05,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 1218 transitions, 12353 flow, removed 14 selfloop flow, removed 23 redundant places. [2021-12-06 21:07:05,880 INFO L242 Difference]: Finished difference. Result has 451 places, 795 transitions, 8455 flow [2021-12-06 21:07:05,881 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=6314, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=8455, PETRI_PLACES=451, PETRI_TRANSITIONS=795} [2021-12-06 21:07:05,881 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 162 predicate places. [2021-12-06 21:07:05,882 INFO L470 AbstractCegarLoop]: Abstraction has has 451 places, 795 transitions, 8455 flow [2021-12-06 21:07:05,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 130.33333333333334) internal successors, (2737), 21 states have internal predecessors, (2737), 0 states have call successors, (0), 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-12-06 21:07:05,882 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:05,882 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, 1, 1] [2021-12-06 21:07:05,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 21:07:05,882 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-12-06 21:07:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1404188626, now seen corresponding path program 4 times [2021-12-06 21:07:05,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:05,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061600488] [2021-12-06 21:07:05,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:05,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:06,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:06,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061600488] [2021-12-06 21:07:06,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061600488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:06,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:06,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-06 21:07:06,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541742263] [2021-12-06 21:07:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:06,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 21:07:06,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 21:07:06,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-12-06 21:07:06,242 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2021-12-06 21:07:06,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 795 transitions, 8455 flow. Second operand has 20 states, 20 states have (on average 131.55) internal successors, (2631), 20 states have internal predecessors, (2631), 0 states have call successors, (0), 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-12-06 21:07:06,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:06,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2021-12-06 21:07:06,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:10,561 INFO L129 PetriNetUnfolder]: 3299/9923 cut-off events. [2021-12-06 21:07:10,561 INFO L130 PetriNetUnfolder]: For 43274/43288 co-relation queries the response was YES. [2021-12-06 21:07:10,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39798 conditions, 9923 events. 3299/9923 cut-off events. For 43274/43288 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 89158 event pairs, 428 based on Foata normal form. 29/9769 useless extension candidates. Maximal degree in co-relation 39610. Up to 1838 conditions per place. [2021-12-06 21:07:10,654 INFO L132 encePairwiseOnDemand]: 252/286 looper letters, 890 selfloop transitions, 283 changer transitions 3/1295 dead transitions. [2021-12-06 21:07:10,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 1295 transitions, 15255 flow [2021-12-06 21:07:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-06 21:07:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-12-06 21:07:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4778 transitions. [2021-12-06 21:07:10,659 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4913615795968737 [2021-12-06 21:07:10,659 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4778 transitions. [2021-12-06 21:07:10,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4778 transitions. [2021-12-06 21:07:10,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:10,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4778 transitions. [2021-12-06 21:07:10,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 140.52941176470588) internal successors, (4778), 34 states have internal predecessors, (4778), 0 states have call successors, (0), 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-12-06 21:07:10,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 286.0) internal successors, (10010), 35 states have internal predecessors, (10010), 0 states have call successors, (0), 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-12-06 21:07:10,670 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 286.0) internal successors, (10010), 35 states have internal predecessors, (10010), 0 states have call successors, (0), 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-12-06 21:07:10,670 INFO L186 Difference]: Start difference. First operand has 451 places, 795 transitions, 8455 flow. Second operand 34 states and 4778 transitions. [2021-12-06 21:07:10,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 1295 transitions, 15255 flow [2021-12-06 21:07:10,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 1295 transitions, 15165 flow, removed 19 selfloop flow, removed 14 redundant places. [2021-12-06 21:07:11,008 INFO L242 Difference]: Finished difference. Result has 483 places, 894 transitions, 11133 flow [2021-12-06 21:07:11,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=8387, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=11133, PETRI_PLACES=483, PETRI_TRANSITIONS=894} [2021-12-06 21:07:11,009 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 194 predicate places. [2021-12-06 21:07:11,009 INFO L470 AbstractCegarLoop]: Abstraction has has 483 places, 894 transitions, 11133 flow [2021-12-06 21:07:11,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 131.55) internal successors, (2631), 20 states have internal predecessors, (2631), 0 states have call successors, (0), 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-12-06 21:07:11,010 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 21:07:11,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-06 21:07:11,010 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-12-06 21:07:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1153459662, now seen corresponding path program 5 times [2021-12-06 21:07:11,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:11,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741176401] [2021-12-06 21:07:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:11,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:11,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:11,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741176401] [2021-12-06 21:07:11,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741176401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:11,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:11,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-06 21:07:11,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369113988] [2021-12-06 21:07:11,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:11,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 21:07:11,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:11,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 21:07:11,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-12-06 21:07:11,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2021-12-06 21:07:11,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 894 transitions, 11133 flow. Second operand has 20 states, 20 states have (on average 131.55) internal successors, (2631), 20 states have internal predecessors, (2631), 0 states have call successors, (0), 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-12-06 21:07:11,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:11,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2021-12-06 21:07:11,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:16,542 INFO L129 PetriNetUnfolder]: 3728/11211 cut-off events. [2021-12-06 21:07:16,542 INFO L130 PetriNetUnfolder]: For 63662/63678 co-relation queries the response was YES. [2021-12-06 21:07:16,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47634 conditions, 11211 events. 3728/11211 cut-off events. For 63662/63678 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 103974 event pairs, 471 based on Foata normal form. 31/11046 useless extension candidates. Maximal degree in co-relation 47429. Up to 2268 conditions per place. [2021-12-06 21:07:16,712 INFO L132 encePairwiseOnDemand]: 252/286 looper letters, 902 selfloop transitions, 335 changer transitions 3/1359 dead transitions. [2021-12-06 21:07:16,712 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 1359 transitions, 17843 flow [2021-12-06 21:07:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-06 21:07:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-12-06 21:07:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4642 transitions. [2021-12-06 21:07:16,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.49184149184149184 [2021-12-06 21:07:16,717 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4642 transitions. [2021-12-06 21:07:16,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4642 transitions. [2021-12-06 21:07:16,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:16,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4642 transitions. [2021-12-06 21:07:16,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 140.66666666666666) internal successors, (4642), 33 states have internal predecessors, (4642), 0 states have call successors, (0), 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-12-06 21:07:16,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 286.0) internal successors, (9724), 34 states have internal predecessors, (9724), 0 states have call successors, (0), 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-12-06 21:07:16,728 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 286.0) internal successors, (9724), 34 states have internal predecessors, (9724), 0 states have call successors, (0), 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-12-06 21:07:16,728 INFO L186 Difference]: Start difference. First operand has 483 places, 894 transitions, 11133 flow. Second operand 33 states and 4642 transitions. [2021-12-06 21:07:16,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 1359 transitions, 17843 flow [2021-12-06 21:07:17,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 501 places, 1359 transitions, 17689 flow, removed 55 selfloop flow, removed 14 redundant places. [2021-12-06 21:07:17,182 INFO L242 Difference]: Finished difference. Result has 512 places, 970 transitions, 13826 flow [2021-12-06 21:07:17,183 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=10987, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=13826, PETRI_PLACES=512, PETRI_TRANSITIONS=970} [2021-12-06 21:07:17,183 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 223 predicate places. [2021-12-06 21:07:17,183 INFO L470 AbstractCegarLoop]: Abstraction has has 512 places, 970 transitions, 13826 flow [2021-12-06 21:07:17,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 131.55) internal successors, (2631), 20 states have internal predecessors, (2631), 0 states have call successors, (0), 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-12-06 21:07:17,183 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:17,184 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, 1, 1] [2021-12-06 21:07:17,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-06 21:07:17,184 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-12-06 21:07:17,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1838917866, now seen corresponding path program 1 times [2021-12-06 21:07:17,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:17,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918226290] [2021-12-06 21:07:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:17,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:17,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:17,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918226290] [2021-12-06 21:07:17,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918226290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:17,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:17,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 21:07:17,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697351028] [2021-12-06 21:07:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:17,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:07:17,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:07:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:07:17,275 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 286 [2021-12-06 21:07:17,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 970 transitions, 13826 flow. Second operand has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 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-12-06 21:07:17,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:17,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 286 [2021-12-06 21:07:17,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:20,732 INFO L129 PetriNetUnfolder]: 3033/10075 cut-off events. [2021-12-06 21:07:20,732 INFO L130 PetriNetUnfolder]: For 71703/72086 co-relation queries the response was YES. [2021-12-06 21:07:20,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44230 conditions, 10075 events. 3033/10075 cut-off events. For 71703/72086 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 95408 event pairs, 1040 based on Foata normal form. 105/10029 useless extension candidates. Maximal degree in co-relation 44032. Up to 5807 conditions per place. [2021-12-06 21:07:20,845 INFO L132 encePairwiseOnDemand]: 263/286 looper letters, 627 selfloop transitions, 97 changer transitions 106/1104 dead transitions. [2021-12-06 21:07:20,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 1104 transitions, 16654 flow [2021-12-06 21:07:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 21:07:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-06 21:07:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1231 transitions. [2021-12-06 21:07:20,847 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173659673659674 [2021-12-06 21:07:20,847 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1231 transitions. [2021-12-06 21:07:20,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1231 transitions. [2021-12-06 21:07:20,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:20,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1231 transitions. [2021-12-06 21:07:20,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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-12-06 21:07:20,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:07:20,850 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 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-12-06 21:07:20,850 INFO L186 Difference]: Start difference. First operand has 512 places, 970 transitions, 13826 flow. Second operand 6 states and 1231 transitions. [2021-12-06 21:07:20,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 1104 transitions, 16654 flow [2021-12-06 21:07:21,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 1104 transitions, 16513 flow, removed 45 selfloop flow, removed 15 redundant places. [2021-12-06 21:07:21,376 INFO L242 Difference]: Finished difference. Result has 507 places, 965 transitions, 13374 flow [2021-12-06 21:07:21,377 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=13685, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=13374, PETRI_PLACES=507, PETRI_TRANSITIONS=965} [2021-12-06 21:07:21,377 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 218 predicate places. [2021-12-06 21:07:21,377 INFO L470 AbstractCegarLoop]: Abstraction has has 507 places, 965 transitions, 13374 flow [2021-12-06 21:07:21,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.5) internal successors, (1101), 6 states have internal predecessors, (1101), 0 states have call successors, (0), 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-12-06 21:07:21,377 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:21,378 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:07:21,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-06 21:07:21,378 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-12-06 21:07:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 715657019, now seen corresponding path program 1 times [2021-12-06 21:07:21,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:21,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779978174] [2021-12-06 21:07:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:21,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:21,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779978174] [2021-12-06 21:07:21,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779978174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:21,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:21,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-06 21:07:21,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478207155] [2021-12-06 21:07:21,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:21,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 21:07:21,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 21:07:21,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-12-06 21:07:21,724 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2021-12-06 21:07:21,725 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 965 transitions, 13374 flow. Second operand has 20 states, 20 states have (on average 131.8) internal successors, (2636), 20 states have internal predecessors, (2636), 0 states have call successors, (0), 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-12-06 21:07:21,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:21,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2021-12-06 21:07:21,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:26,940 INFO L129 PetriNetUnfolder]: 3658/10906 cut-off events. [2021-12-06 21:07:26,941 INFO L130 PetriNetUnfolder]: For 84453/84458 co-relation queries the response was YES. [2021-12-06 21:07:27,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51043 conditions, 10906 events. 3658/10906 cut-off events. For 84453/84458 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 99213 event pairs, 480 based on Foata normal form. 10/10835 useless extension candidates. Maximal degree in co-relation 50825. Up to 2252 conditions per place. [2021-12-06 21:07:27,066 INFO L132 encePairwiseOnDemand]: 256/286 looper letters, 826 selfloop transitions, 250 changer transitions 29/1224 dead transitions. [2021-12-06 21:07:27,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 1224 transitions, 17607 flow [2021-12-06 21:07:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-06 21:07:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-12-06 21:07:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4677 transitions. [2021-12-06 21:07:27,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4809749074454957 [2021-12-06 21:07:27,071 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4677 transitions. [2021-12-06 21:07:27,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4677 transitions. [2021-12-06 21:07:27,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:27,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4677 transitions. [2021-12-06 21:07:27,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 137.55882352941177) internal successors, (4677), 34 states have internal predecessors, (4677), 0 states have call successors, (0), 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-12-06 21:07:27,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 286.0) internal successors, (10010), 35 states have internal predecessors, (10010), 0 states have call successors, (0), 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-12-06 21:07:27,085 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 286.0) internal successors, (10010), 35 states have internal predecessors, (10010), 0 states have call successors, (0), 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-12-06 21:07:27,085 INFO L186 Difference]: Start difference. First operand has 507 places, 965 transitions, 13374 flow. Second operand 34 states and 4677 transitions. [2021-12-06 21:07:27,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 1224 transitions, 17607 flow [2021-12-06 21:07:27,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 1224 transitions, 17193 flow, removed 139 selfloop flow, removed 11 redundant places. [2021-12-06 21:07:27,701 INFO L242 Difference]: Finished difference. Result has 508 places, 975 transitions, 13947 flow [2021-12-06 21:07:27,702 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=13000, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=13947, PETRI_PLACES=508, PETRI_TRANSITIONS=975} [2021-12-06 21:07:27,702 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 219 predicate places. [2021-12-06 21:07:27,702 INFO L470 AbstractCegarLoop]: Abstraction has has 508 places, 975 transitions, 13947 flow [2021-12-06 21:07:27,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 131.8) internal successors, (2636), 20 states have internal predecessors, (2636), 0 states have call successors, (0), 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-12-06 21:07:27,702 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:27,703 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:07:27,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-06 21:07:27,703 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-12-06 21:07:27,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:27,703 INFO L85 PathProgramCache]: Analyzing trace with hash -123769103, now seen corresponding path program 2 times [2021-12-06 21:07:27,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:27,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747158977] [2021-12-06 21:07:27,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:27,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:28,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:28,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747158977] [2021-12-06 21:07:28,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747158977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:28,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:28,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-06 21:07:28,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521905278] [2021-12-06 21:07:28,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:28,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 21:07:28,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:28,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 21:07:28,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-06 21:07:28,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2021-12-06 21:07:28,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 975 transitions, 13947 flow. Second operand has 22 states, 22 states have (on average 130.3181818181818) internal successors, (2867), 22 states have internal predecessors, (2867), 0 states have call successors, (0), 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-12-06 21:07:28,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:28,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2021-12-06 21:07:28,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:33,194 INFO L129 PetriNetUnfolder]: 3718/10978 cut-off events. [2021-12-06 21:07:33,194 INFO L130 PetriNetUnfolder]: For 95406/95411 co-relation queries the response was YES. [2021-12-06 21:07:33,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52763 conditions, 10978 events. 3718/10978 cut-off events. For 95406/95411 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 99646 event pairs, 470 based on Foata normal form. 10/10890 useless extension candidates. Maximal degree in co-relation 52544. Up to 1999 conditions per place. [2021-12-06 21:07:33,310 INFO L132 encePairwiseOnDemand]: 252/286 looper letters, 882 selfloop transitions, 277 changer transitions 31/1307 dead transitions. [2021-12-06 21:07:33,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 1307 transitions, 18933 flow [2021-12-06 21:07:33,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-06 21:07:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-12-06 21:07:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 4928 transitions. [2021-12-06 21:07:33,315 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2021-12-06 21:07:33,315 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 4928 transitions. [2021-12-06 21:07:33,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 4928 transitions. [2021-12-06 21:07:33,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:33,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 4928 transitions. [2021-12-06 21:07:33,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 136.88888888888889) internal successors, (4928), 36 states have internal predecessors, (4928), 0 states have call successors, (0), 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-12-06 21:07:33,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 286.0) internal successors, (10582), 37 states have internal predecessors, (10582), 0 states have call successors, (0), 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-12-06 21:07:33,326 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 286.0) internal successors, (10582), 37 states have internal predecessors, (10582), 0 states have call successors, (0), 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-12-06 21:07:33,326 INFO L186 Difference]: Start difference. First operand has 508 places, 975 transitions, 13947 flow. Second operand 36 states and 4928 transitions. [2021-12-06 21:07:33,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 1307 transitions, 18933 flow [2021-12-06 21:07:34,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 1307 transitions, 18641 flow, removed 16 selfloop flow, removed 26 redundant places. [2021-12-06 21:07:34,028 INFO L242 Difference]: Finished difference. Result has 521 places, 987 transitions, 14635 flow [2021-12-06 21:07:34,029 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=13655, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=975, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=265, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=14635, PETRI_PLACES=521, PETRI_TRANSITIONS=987} [2021-12-06 21:07:34,029 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 232 predicate places. [2021-12-06 21:07:34,029 INFO L470 AbstractCegarLoop]: Abstraction has has 521 places, 987 transitions, 14635 flow [2021-12-06 21:07:34,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 130.3181818181818) internal successors, (2867), 22 states have internal predecessors, (2867), 0 states have call successors, (0), 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-12-06 21:07:34,030 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:34,030 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:07:34,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-06 21:07:34,030 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-12-06 21:07:34,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:34,030 INFO L85 PathProgramCache]: Analyzing trace with hash -173439519, now seen corresponding path program 3 times [2021-12-06 21:07:34,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:34,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724814825] [2021-12-06 21:07:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:34,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:34,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:34,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724814825] [2021-12-06 21:07:34,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724814825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:34,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:34,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-06 21:07:34,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146582927] [2021-12-06 21:07:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:34,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-06 21:07:34,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-06 21:07:34,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-12-06 21:07:34,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2021-12-06 21:07:34,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 987 transitions, 14635 flow. Second operand has 20 states, 20 states have (on average 131.8) internal successors, (2636), 20 states have internal predecessors, (2636), 0 states have call successors, (0), 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-12-06 21:07:34,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:34,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2021-12-06 21:07:34,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:40,058 INFO L129 PetriNetUnfolder]: 3699/10861 cut-off events. [2021-12-06 21:07:40,058 INFO L130 PetriNetUnfolder]: For 105117/105122 co-relation queries the response was YES. [2021-12-06 21:07:40,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54133 conditions, 10861 events. 3699/10861 cut-off events. For 105117/105122 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 98045 event pairs, 561 based on Foata normal form. 10/10762 useless extension candidates. Maximal degree in co-relation 53909. Up to 2185 conditions per place. [2021-12-06 21:07:40,181 INFO L132 encePairwiseOnDemand]: 252/286 looper letters, 927 selfloop transitions, 273 changer transitions 29/1348 dead transitions. [2021-12-06 21:07:40,181 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 1348 transitions, 20260 flow [2021-12-06 21:07:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 21:07:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-12-06 21:07:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4334 transitions. [2021-12-06 21:07:40,185 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.48883374689826303 [2021-12-06 21:07:40,185 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4334 transitions. [2021-12-06 21:07:40,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4334 transitions. [2021-12-06 21:07:40,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:40,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4334 transitions. [2021-12-06 21:07:40,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 139.80645161290323) internal successors, (4334), 31 states have internal predecessors, (4334), 0 states have call successors, (0), 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-12-06 21:07:40,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 286.0) internal successors, (9152), 32 states have internal predecessors, (9152), 0 states have call successors, (0), 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-12-06 21:07:40,194 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 286.0) internal successors, (9152), 32 states have internal predecessors, (9152), 0 states have call successors, (0), 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-12-06 21:07:40,194 INFO L186 Difference]: Start difference. First operand has 521 places, 987 transitions, 14635 flow. Second operand 31 states and 4334 transitions. [2021-12-06 21:07:40,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 1348 transitions, 20260 flow [2021-12-06 21:07:40,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 1348 transitions, 19760 flow, removed 30 selfloop flow, removed 29 redundant places. [2021-12-06 21:07:40,859 INFO L242 Difference]: Finished difference. Result has 525 places, 996 transitions, 15302 flow [2021-12-06 21:07:40,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=14185, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=987, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=714, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=15302, PETRI_PLACES=525, PETRI_TRANSITIONS=996} [2021-12-06 21:07:40,860 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 236 predicate places. [2021-12-06 21:07:40,860 INFO L470 AbstractCegarLoop]: Abstraction has has 525 places, 996 transitions, 15302 flow [2021-12-06 21:07:40,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 131.8) internal successors, (2636), 20 states have internal predecessors, (2636), 0 states have call successors, (0), 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-12-06 21:07:40,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:40,861 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:07:40,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-06 21:07:40,861 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-12-06 21:07:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:40,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1664182807, now seen corresponding path program 4 times [2021-12-06 21:07:40,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:40,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520103808] [2021-12-06 21:07:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:40,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:41,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:41,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520103808] [2021-12-06 21:07:41,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520103808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:41,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:41,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-06 21:07:41,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807770867] [2021-12-06 21:07:41,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:41,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-06 21:07:41,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:41,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-06 21:07:41,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-06 21:07:41,159 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2021-12-06 21:07:41,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 996 transitions, 15302 flow. Second operand has 21 states, 21 states have (on average 130.57142857142858) internal successors, (2742), 21 states have internal predecessors, (2742), 0 states have call successors, (0), 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-12-06 21:07:41,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:41,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2021-12-06 21:07:41,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:46,936 INFO L129 PetriNetUnfolder]: 3734/10968 cut-off events. [2021-12-06 21:07:46,936 INFO L130 PetriNetUnfolder]: For 113767/113772 co-relation queries the response was YES. [2021-12-06 21:07:47,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54841 conditions, 10968 events. 3734/10968 cut-off events. For 113767/113772 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 99737 event pairs, 358 based on Foata normal form. 10/10903 useless extension candidates. Maximal degree in co-relation 54611. Up to 2064 conditions per place. [2021-12-06 21:07:47,112 INFO L132 encePairwiseOnDemand]: 251/286 looper letters, 874 selfloop transitions, 356 changer transitions 37/1384 dead transitions. [2021-12-06 21:07:47,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 1384 transitions, 20627 flow [2021-12-06 21:07:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-06 21:07:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2021-12-06 21:07:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5898 transitions. [2021-12-06 21:07:47,119 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47959017726459585 [2021-12-06 21:07:47,119 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 5898 transitions. [2021-12-06 21:07:47,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 5898 transitions. [2021-12-06 21:07:47,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:47,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 5898 transitions. [2021-12-06 21:07:47,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 137.1627906976744) internal successors, (5898), 43 states have internal predecessors, (5898), 0 states have call successors, (0), 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-12-06 21:07:47,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 286.0) internal successors, (12584), 44 states have internal predecessors, (12584), 0 states have call successors, (0), 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-12-06 21:07:47,136 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 286.0) internal successors, (12584), 44 states have internal predecessors, (12584), 0 states have call successors, (0), 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-12-06 21:07:47,136 INFO L186 Difference]: Start difference. First operand has 525 places, 996 transitions, 15302 flow. Second operand 43 states and 5898 transitions. [2021-12-06 21:07:47,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 1384 transitions, 20627 flow [2021-12-06 21:07:47,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 1384 transitions, 20140 flow, removed 15 selfloop flow, removed 28 redundant places. [2021-12-06 21:07:47,907 INFO L242 Difference]: Finished difference. Result has 548 places, 1032 transitions, 16321 flow [2021-12-06 21:07:47,908 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=14821, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=320, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=16321, PETRI_PLACES=548, PETRI_TRANSITIONS=1032} [2021-12-06 21:07:47,909 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 259 predicate places. [2021-12-06 21:07:47,909 INFO L470 AbstractCegarLoop]: Abstraction has has 548 places, 1032 transitions, 16321 flow [2021-12-06 21:07:47,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 130.57142857142858) internal successors, (2742), 21 states have internal predecessors, (2742), 0 states have call successors, (0), 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-12-06 21:07:47,909 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:47,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:07:47,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-06 21:07:47,910 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-12-06 21:07:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash 27292161, now seen corresponding path program 1 times [2021-12-06 21:07:47,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:47,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883488068] [2021-12-06 21:07:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:47,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:48,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883488068] [2021-12-06 21:07:48,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883488068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:48,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:48,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-12-06 21:07:48,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084208663] [2021-12-06 21:07:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:48,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-06 21:07:48,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-06 21:07:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2021-12-06 21:07:48,597 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 286 [2021-12-06 21:07:48,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 1032 transitions, 16321 flow. Second operand has 26 states, 26 states have (on average 128.5) internal successors, (3341), 26 states have internal predecessors, (3341), 0 states have call successors, (0), 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-12-06 21:07:48,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:48,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 286 [2021-12-06 21:07:48,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:07:55,815 INFO L129 PetriNetUnfolder]: 4116/12148 cut-off events. [2021-12-06 21:07:55,815 INFO L130 PetriNetUnfolder]: For 134716/134720 co-relation queries the response was YES. [2021-12-06 21:07:55,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61619 conditions, 12148 events. 4116/12148 cut-off events. For 134716/134720 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 111451 event pairs, 749 based on Foata normal form. 16/12073 useless extension candidates. Maximal degree in co-relation 61379. Up to 2091 conditions per place. [2021-12-06 21:07:55,948 INFO L132 encePairwiseOnDemand]: 252/286 looper letters, 1169 selfloop transitions, 212 changer transitions 134/1631 dead transitions. [2021-12-06 21:07:55,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 1631 transitions, 25984 flow [2021-12-06 21:07:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-12-06 21:07:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-12-06 21:07:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 7753 transitions. [2021-12-06 21:07:55,957 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4673860622136484 [2021-12-06 21:07:55,957 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 7753 transitions. [2021-12-06 21:07:55,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 7753 transitions. [2021-12-06 21:07:55,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:07:55,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 7753 transitions. [2021-12-06 21:07:55,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 133.67241379310346) internal successors, (7753), 58 states have internal predecessors, (7753), 0 states have call successors, (0), 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-12-06 21:07:55,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 286.0) internal successors, (16874), 59 states have internal predecessors, (16874), 0 states have call successors, (0), 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-12-06 21:07:55,980 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 286.0) internal successors, (16874), 59 states have internal predecessors, (16874), 0 states have call successors, (0), 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-12-06 21:07:55,980 INFO L186 Difference]: Start difference. First operand has 548 places, 1032 transitions, 16321 flow. Second operand 58 states and 7753 transitions. [2021-12-06 21:07:55,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 1631 transitions, 25984 flow [2021-12-06 21:07:56,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 1631 transitions, 25187 flow, removed 177 selfloop flow, removed 39 redundant places. [2021-12-06 21:07:56,715 INFO L242 Difference]: Finished difference. Result has 578 places, 1085 transitions, 16723 flow [2021-12-06 21:07:56,716 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=15776, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=16723, PETRI_PLACES=578, PETRI_TRANSITIONS=1085} [2021-12-06 21:07:56,716 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 289 predicate places. [2021-12-06 21:07:56,716 INFO L470 AbstractCegarLoop]: Abstraction has has 578 places, 1085 transitions, 16723 flow [2021-12-06 21:07:56,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 128.5) internal successors, (3341), 26 states have internal predecessors, (3341), 0 states have call successors, (0), 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-12-06 21:07:56,717 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:07:56,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:07:56,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 21:07:56,717 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-12-06 21:07:56,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:07:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1385112633, now seen corresponding path program 2 times [2021-12-06 21:07:56,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:07:56,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278866373] [2021-12-06 21:07:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:07:56,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:07:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:07:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:07:57,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:07:57,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278866373] [2021-12-06 21:07:57,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278866373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:07:57,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:07:57,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-06 21:07:57,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75169847] [2021-12-06 21:07:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:07:57,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 21:07:57,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:07:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 21:07:57,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2021-12-06 21:07:57,152 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 286 [2021-12-06 21:07:57,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 1085 transitions, 16723 flow. Second operand has 23 states, 23 states have (on average 129.08695652173913) internal successors, (2969), 23 states have internal predecessors, (2969), 0 states have call successors, (0), 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-12-06 21:07:57,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:07:57,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 286 [2021-12-06 21:07:57,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:08:04,809 INFO L129 PetriNetUnfolder]: 4919/14300 cut-off events. [2021-12-06 21:08:04,810 INFO L130 PetriNetUnfolder]: For 160570/160577 co-relation queries the response was YES. [2021-12-06 21:08:04,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72831 conditions, 14300 events. 4919/14300 cut-off events. For 160570/160577 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 134390 event pairs, 1107 based on Foata normal form. 13/14199 useless extension candidates. Maximal degree in co-relation 72604. Up to 2091 conditions per place. [2021-12-06 21:08:05,002 INFO L132 encePairwiseOnDemand]: 249/286 looper letters, 1244 selfloop transitions, 264 changer transitions 44/1668 dead transitions. [2021-12-06 21:08:05,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 1668 transitions, 26899 flow [2021-12-06 21:08:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-06 21:08:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-12-06 21:08:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 6338 transitions. [2021-12-06 21:08:05,007 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47150721618806724 [2021-12-06 21:08:05,007 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 6338 transitions. [2021-12-06 21:08:05,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 6338 transitions. [2021-12-06 21:08:05,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:08:05,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 6338 transitions. [2021-12-06 21:08:05,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 134.85106382978722) internal successors, (6338), 47 states have internal predecessors, (6338), 0 states have call successors, (0), 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-12-06 21:08:05,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 286.0) internal successors, (13728), 48 states have internal predecessors, (13728), 0 states have call successors, (0), 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-12-06 21:08:05,018 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 286.0) internal successors, (13728), 48 states have internal predecessors, (13728), 0 states have call successors, (0), 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-12-06 21:08:05,018 INFO L186 Difference]: Start difference. First operand has 578 places, 1085 transitions, 16723 flow. Second operand 47 states and 6338 transitions. [2021-12-06 21:08:05,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 1668 transitions, 26899 flow [2021-12-06 21:08:05,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 1668 transitions, 26661 flow, removed 29 selfloop flow, removed 26 redundant places. [2021-12-06 21:08:05,827 INFO L242 Difference]: Finished difference. Result has 598 places, 1177 transitions, 19303 flow [2021-12-06 21:08:05,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=16527, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=850, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=19303, PETRI_PLACES=598, PETRI_TRANSITIONS=1177} [2021-12-06 21:08:05,828 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 309 predicate places. [2021-12-06 21:08:05,828 INFO L470 AbstractCegarLoop]: Abstraction has has 598 places, 1177 transitions, 19303 flow [2021-12-06 21:08:05,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 129.08695652173913) internal successors, (2969), 23 states have internal predecessors, (2969), 0 states have call successors, (0), 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-12-06 21:08:05,829 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:08:05,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:08:05,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 21:08:05,829 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-12-06 21:08:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:08:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1465330557, now seen corresponding path program 1 times [2021-12-06 21:08:05,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:08:05,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064531971] [2021-12-06 21:08:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:08:05,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:08:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:08:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:08:06,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:08:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064531971] [2021-12-06 21:08:06,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064531971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:08:06,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:08:06,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-12-06 21:08:06,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40165543] [2021-12-06 21:08:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:08:06,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-06 21:08:06,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:08:06,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-06 21:08:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2021-12-06 21:08:06,189 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 286 [2021-12-06 21:08:06,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 1177 transitions, 19303 flow. Second operand has 22 states, 22 states have (on average 127.36363636363636) internal successors, (2802), 22 states have internal predecessors, (2802), 0 states have call successors, (0), 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-12-06 21:08:06,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:08:06,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 286 [2021-12-06 21:08:06,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:08:13,785 INFO L129 PetriNetUnfolder]: 5165/14978 cut-off events. [2021-12-06 21:08:13,785 INFO L130 PetriNetUnfolder]: For 169070/169078 co-relation queries the response was YES. [2021-12-06 21:08:13,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76044 conditions, 14978 events. 5165/14978 cut-off events. For 169070/169078 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 142463 event pairs, 905 based on Foata normal form. 22/14875 useless extension candidates. Maximal degree in co-relation 75803. Up to 2455 conditions per place. [2021-12-06 21:08:13,964 INFO L132 encePairwiseOnDemand]: 246/286 looper letters, 1054 selfloop transitions, 300 changer transitions 84/1552 dead transitions. [2021-12-06 21:08:13,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 1552 transitions, 26813 flow [2021-12-06 21:08:13,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-06 21:08:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-12-06 21:08:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 5481 transitions. [2021-12-06 21:08:13,968 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4674228210813577 [2021-12-06 21:08:13,968 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 5481 transitions. [2021-12-06 21:08:13,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 5481 transitions. [2021-12-06 21:08:13,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:08:13,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 5481 transitions. [2021-12-06 21:08:13,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 133.6829268292683) internal successors, (5481), 41 states have internal predecessors, (5481), 0 states have call successors, (0), 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-12-06 21:08:13,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 286.0) internal successors, (12012), 42 states have internal predecessors, (12012), 0 states have call successors, (0), 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-12-06 21:08:13,978 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 286.0) internal successors, (12012), 42 states have internal predecessors, (12012), 0 states have call successors, (0), 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-12-06 21:08:13,978 INFO L186 Difference]: Start difference. First operand has 598 places, 1177 transitions, 19303 flow. Second operand 41 states and 5481 transitions. [2021-12-06 21:08:13,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 1552 transitions, 26813 flow [2021-12-06 21:08:14,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 1552 transitions, 26444 flow, removed 43 selfloop flow, removed 21 redundant places. [2021-12-06 21:08:14,959 INFO L242 Difference]: Finished difference. Result has 627 places, 1202 transitions, 20394 flow [2021-12-06 21:08:14,960 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=18970, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=897, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=20394, PETRI_PLACES=627, PETRI_TRANSITIONS=1202} [2021-12-06 21:08:14,961 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 338 predicate places. [2021-12-06 21:08:14,961 INFO L470 AbstractCegarLoop]: Abstraction has has 627 places, 1202 transitions, 20394 flow [2021-12-06 21:08:14,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 127.36363636363636) internal successors, (2802), 22 states have internal predecessors, (2802), 0 states have call successors, (0), 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-12-06 21:08:14,962 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:08:14,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:08:14,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 21:08:14,962 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-12-06 21:08:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:08:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1801233783, now seen corresponding path program 3 times [2021-12-06 21:08:14,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:08:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704261455] [2021-12-06 21:08:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:08:14,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:08:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:08:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:08:15,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:08:15,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704261455] [2021-12-06 21:08:15,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704261455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:08:15,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:08:15,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-12-06 21:08:15,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32409908] [2021-12-06 21:08:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:08:15,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-06 21:08:15,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:08:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-06 21:08:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2021-12-06 21:08:15,465 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 286 [2021-12-06 21:08:15,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 1202 transitions, 20394 flow. Second operand has 25 states, 25 states have (on average 128.68) internal successors, (3217), 25 states have internal predecessors, (3217), 0 states have call successors, (0), 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-12-06 21:08:15,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:08:15,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 286 [2021-12-06 21:08:15,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:08:25,115 INFO L129 PetriNetUnfolder]: 5790/16596 cut-off events. [2021-12-06 21:08:25,115 INFO L130 PetriNetUnfolder]: For 219385/219397 co-relation queries the response was YES. [2021-12-06 21:08:25,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91213 conditions, 16596 events. 5790/16596 cut-off events. For 219385/219397 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 160486 event pairs, 1201 based on Foata normal form. 23/16482 useless extension candidates. Maximal degree in co-relation 90960. Up to 2255 conditions per place. [2021-12-06 21:08:25,376 INFO L132 encePairwiseOnDemand]: 245/286 looper letters, 1332 selfloop transitions, 309 changer transitions 32/1789 dead transitions. [2021-12-06 21:08:25,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 1789 transitions, 31752 flow [2021-12-06 21:08:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-12-06 21:08:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-12-06 21:08:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 7097 transitions. [2021-12-06 21:08:25,383 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4682016097110437 [2021-12-06 21:08:25,383 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 7097 transitions. [2021-12-06 21:08:25,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 7097 transitions. [2021-12-06 21:08:25,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:08:25,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 7097 transitions. [2021-12-06 21:08:25,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 133.9056603773585) internal successors, (7097), 53 states have internal predecessors, (7097), 0 states have call successors, (0), 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-12-06 21:08:25,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 286.0) internal successors, (15444), 54 states have internal predecessors, (15444), 0 states have call successors, (0), 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-12-06 21:08:25,397 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 286.0) internal successors, (15444), 54 states have internal predecessors, (15444), 0 states have call successors, (0), 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-12-06 21:08:25,397 INFO L186 Difference]: Start difference. First operand has 627 places, 1202 transitions, 20394 flow. Second operand 53 states and 7097 transitions. [2021-12-06 21:08:25,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 1789 transitions, 31752 flow [2021-12-06 21:08:26,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 1789 transitions, 31339 flow, removed 60 selfloop flow, removed 24 redundant places. [2021-12-06 21:08:26,644 INFO L242 Difference]: Finished difference. Result has 659 places, 1296 transitions, 23505 flow [2021-12-06 21:08:26,645 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=20058, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=916, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=23505, PETRI_PLACES=659, PETRI_TRANSITIONS=1296} [2021-12-06 21:08:26,645 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 370 predicate places. [2021-12-06 21:08:26,645 INFO L470 AbstractCegarLoop]: Abstraction has has 659 places, 1296 transitions, 23505 flow [2021-12-06 21:08:26,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 128.68) internal successors, (3217), 25 states have internal predecessors, (3217), 0 states have call successors, (0), 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-12-06 21:08:26,646 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:08:26,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:08:26,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-06 21:08:26,646 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-12-06 21:08:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:08:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1202420803, now seen corresponding path program 4 times [2021-12-06 21:08:26,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:08:26,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966551155] [2021-12-06 21:08:26,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:08:26,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:08:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:08:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:08:27,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:08:27,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966551155] [2021-12-06 21:08:27,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966551155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:08:27,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:08:27,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-06 21:08:27,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832820405] [2021-12-06 21:08:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:08:27,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 21:08:27,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:08:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 21:08:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-12-06 21:08:27,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 286 [2021-12-06 21:08:27,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 1296 transitions, 23505 flow. Second operand has 23 states, 23 states have (on average 129.08695652173913) internal successors, (2969), 23 states have internal predecessors, (2969), 0 states have call successors, (0), 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-12-06 21:08:27,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:08:27,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 286 [2021-12-06 21:08:27,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:08:37,647 INFO L129 PetriNetUnfolder]: 6711/19346 cut-off events. [2021-12-06 21:08:37,647 INFO L130 PetriNetUnfolder]: For 272881/272898 co-relation queries the response was YES. [2021-12-06 21:08:37,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107655 conditions, 19346 events. 6711/19346 cut-off events. For 272881/272898 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 192870 event pairs, 1326 based on Foata normal form. 28/19211 useless extension candidates. Maximal degree in co-relation 107392. Up to 3391 conditions per place. [2021-12-06 21:08:37,917 INFO L132 encePairwiseOnDemand]: 251/286 looper letters, 1429 selfloop transitions, 350 changer transitions 36/1931 dead transitions. [2021-12-06 21:08:37,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 1931 transitions, 36083 flow [2021-12-06 21:08:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-06 21:08:37,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-12-06 21:08:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 6373 transitions. [2021-12-06 21:08:37,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4741109953875911 [2021-12-06 21:08:37,922 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 6373 transitions. [2021-12-06 21:08:37,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 6373 transitions. [2021-12-06 21:08:37,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:08:37,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 6373 transitions. [2021-12-06 21:08:37,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 135.59574468085106) internal successors, (6373), 47 states have internal predecessors, (6373), 0 states have call successors, (0), 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-12-06 21:08:37,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 286.0) internal successors, (13728), 48 states have internal predecessors, (13728), 0 states have call successors, (0), 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-12-06 21:08:37,933 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 286.0) internal successors, (13728), 48 states have internal predecessors, (13728), 0 states have call successors, (0), 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-12-06 21:08:37,933 INFO L186 Difference]: Start difference. First operand has 659 places, 1296 transitions, 23505 flow. Second operand 47 states and 6373 transitions. [2021-12-06 21:08:37,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 1931 transitions, 36083 flow [2021-12-06 21:08:39,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 1931 transitions, 35712 flow, removed 17 selfloop flow, removed 37 redundant places. [2021-12-06 21:08:39,536 INFO L242 Difference]: Finished difference. Result has 680 places, 1406 transitions, 27213 flow [2021-12-06 21:08:39,537 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=23159, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=27213, PETRI_PLACES=680, PETRI_TRANSITIONS=1406} [2021-12-06 21:08:39,538 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 391 predicate places. [2021-12-06 21:08:39,538 INFO L470 AbstractCegarLoop]: Abstraction has has 680 places, 1406 transitions, 27213 flow [2021-12-06 21:08:39,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 129.08695652173913) internal successors, (2969), 23 states have internal predecessors, (2969), 0 states have call successors, (0), 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-12-06 21:08:39,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:08:39,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:08:39,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-06 21:08:39,539 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-12-06 21:08:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:08:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 517431599, now seen corresponding path program 5 times [2021-12-06 21:08:39,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:08:39,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504256161] [2021-12-06 21:08:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:08:39,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:08:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:08:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:08:39,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:08:39,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504256161] [2021-12-06 21:08:39,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504256161] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:08:39,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:08:39,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-06 21:08:39,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374958956] [2021-12-06 21:08:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:08:39,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 21:08:39,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:08:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 21:08:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-12-06 21:08:39,967 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 286 [2021-12-06 21:08:39,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 1406 transitions, 27213 flow. Second operand has 23 states, 23 states have (on average 129.08695652173913) internal successors, (2969), 23 states have internal predecessors, (2969), 0 states have call successors, (0), 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-12-06 21:08:39,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 21:08:39,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 286 [2021-12-06 21:08:39,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 21:08:52,483 INFO L129 PetriNetUnfolder]: 7584/21785 cut-off events. [2021-12-06 21:08:52,483 INFO L130 PetriNetUnfolder]: For 332909/332925 co-relation queries the response was YES. [2021-12-06 21:08:52,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124390 conditions, 21785 events. 7584/21785 cut-off events. For 332909/332925 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 222414 event pairs, 1331 based on Foata normal form. 27/21630 useless extension candidates. Maximal degree in co-relation 124116. Up to 3391 conditions per place. [2021-12-06 21:08:52,871 INFO L132 encePairwiseOnDemand]: 250/286 looper letters, 1426 selfloop transitions, 427 changer transitions 37/2006 dead transitions. [2021-12-06 21:08:52,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 2006 transitions, 39693 flow [2021-12-06 21:08:52,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-06 21:08:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-12-06 21:08:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 6487 transitions. [2021-12-06 21:08:52,875 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4725378787878788 [2021-12-06 21:08:52,875 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 6487 transitions. [2021-12-06 21:08:52,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 6487 transitions. [2021-12-06 21:08:52,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 21:08:52,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 6487 transitions. [2021-12-06 21:08:52,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 135.14583333333334) internal successors, (6487), 48 states have internal predecessors, (6487), 0 states have call successors, (0), 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-12-06 21:08:52,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 286.0) internal successors, (14014), 49 states have internal predecessors, (14014), 0 states have call successors, (0), 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-12-06 21:08:52,887 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 286.0) internal successors, (14014), 49 states have internal predecessors, (14014), 0 states have call successors, (0), 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-12-06 21:08:52,887 INFO L186 Difference]: Start difference. First operand has 680 places, 1406 transitions, 27213 flow. Second operand 48 states and 6487 transitions. [2021-12-06 21:08:52,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 2006 transitions, 39693 flow [2021-12-06 21:08:55,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 2006 transitions, 39301 flow, removed 49 selfloop flow, removed 27 redundant places. [2021-12-06 21:08:55,036 INFO L242 Difference]: Finished difference. Result has 710 places, 1496 transitions, 31047 flow [2021-12-06 21:08:55,037 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=26833, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=31047, PETRI_PLACES=710, PETRI_TRANSITIONS=1496} [2021-12-06 21:08:55,037 INFO L334 CegarLoopForPetriNet]: 289 programPoint places, 421 predicate places. [2021-12-06 21:08:55,037 INFO L470 AbstractCegarLoop]: Abstraction has has 710 places, 1496 transitions, 31047 flow [2021-12-06 21:08:55,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 129.08695652173913) internal successors, (2969), 23 states have internal predecessors, (2969), 0 states have call successors, (0), 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-12-06 21:08:55,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 21:08:55,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:08:55,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-06 21:08:55,038 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2021-12-06 21:08:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:08:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -650304573, now seen corresponding path program 1 times [2021-12-06 21:08:55,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:08:55,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697965919] [2021-12-06 21:08:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:08:55,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:08:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 21:08:55,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 21:08:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 21:08:55,234 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 21:08:55,234 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 21:08:55,235 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2021-12-06 21:08:55,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (16 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2021-12-06 21:08:55,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2021-12-06 21:08:55,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2021-12-06 21:08:55,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-06 21:08:55,241 INFO L732 BasicCegarLoop]: Path program histogram: [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:08:55,246 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 21:08:55,246 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 21:08:55,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 09:08:55 BasicIcfg [2021-12-06 21:08:55,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 21:08:55,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 21:08:55,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 21:08:55,330 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 21:08:55,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:06:41" (3/4) ... [2021-12-06 21:08:55,333 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 21:08:55,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 21:08:55,333 INFO L158 Benchmark]: Toolchain (without parser) took 135175.34ms. Allocated memory was 138.4MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 93.2MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-06 21:08:55,333 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:08:55,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.92ms. Allocated memory is still 138.4MB. Free memory was 92.9MB in the beginning and 83.7MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 21:08:55,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.45ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 80.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 21:08:55,334 INFO L158 Benchmark]: Boogie Preprocessor took 51.53ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 76.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 21:08:55,334 INFO L158 Benchmark]: RCFGBuilder took 523.06ms. Allocated memory is still 138.4MB. Free memory was 76.9MB in the beginning and 51.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-06 21:08:55,334 INFO L158 Benchmark]: TraceAbstraction took 133964.51ms. Allocated memory was 138.4MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 51.7MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-06 21:08:55,335 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 4.8GB. Free memory is still 3.4GB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:08:55,336 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.13ms. Allocated memory is still 138.4MB. Free memory is still 112.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.92ms. Allocated memory is still 138.4MB. Free memory was 92.9MB in the beginning and 83.7MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.45ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 80.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.53ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 76.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 523.06ms. Allocated memory is still 138.4MB. Free memory was 76.9MB in the beginning and 51.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 133964.51ms. Allocated memory was 138.4MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 51.7MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 4.8GB. Free memory is still 3.4GB. There was no memory consumed. Max. memory is 16.1GB. * 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={3:0}, B={0:0}] [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}] [L1243] 0 pthread_t t1; VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, t1={13:0}] [L1244] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-2:0}, p={-2:0}, t1={13:0}] [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=9, A={0:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, p={-2:0}, x=9] [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A = malloc(sizeof(struct s))=107, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, malloc(sizeof(struct s))={-3:0}, p={-2:0}, t1={13:0}] [L1247] 0 init(A,3) VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=3, A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-3:0}, p={-3:0}, x=3] [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1248] 0 A->next = p VAL [A={-3:0}, A_mutex={3:0}, B={0:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1249] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B = malloc(sizeof(struct s))=120, B_mutex={4:0}, malloc(sizeof(struct s))={11:0}, p={-2:0}, t1={13:0}] [L1250] 0 init(B,5) VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1229] 0 p -> next = ((void *)0) VAL [\old(x)=5, A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={11:0}, p={11:0}, x=5] [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1251] 0 B->next = p VAL [A={-3:0}, A_mutex={3:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=-1, t1={13:0}] [L1254] EXPR 0 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1254] 0 p = A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1255] EXPR 0 p->datum VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1255] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1235] EXPR 1 A->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] EXPR 0 B->next VAL [A={-3:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] EXPR 1 A->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] EXPR 1 A->next->datum VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A->next={-2:0}, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] EXPR 1 A->next->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B->next={-2:0}, B_mutex={4:0}, p={-2:0}, t1={13:0}] [L1259] EXPR 0 p->datum VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=124, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A->next={-2:0}, A->next->datum=9, A->next->datum++=9, A->next->datum++=124, A_mutex={3:0}, arg={0:0}, arg={0:0}, B={11:0}, B_mutex={4:0}, p={-2:0}, p->datum=9, t1={13: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 -> datum = x [1228] * C: A->next = p [1248] * C: B->next = p [1251] * C: A->next->datum++ [1235] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: B = malloc(sizeof(struct s)) [1249] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: A->next = p [1248] * C: A = malloc(sizeof(struct s)) [1246] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] 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, 358 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: 133.8s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 124.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11619 SdHoareTripleChecker+Valid, 25.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11619 mSDsluCounter, 11977 SdHoareTripleChecker+Invalid, 21.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9686 mSDsCounter, 6717 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44972 IncrementalHoareTripleChecker+Invalid, 51689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6717 mSolverCounterUnsat, 2399 mSDtfsCounter, 44972 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1084 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11496 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31047occurred in iteration=32, InterpolantAutomatonStates: 727, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 5584 NumberOfCodeBlocks, 5584 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 5343 ConstructedInterpolants, 0 QuantifiedInterpolants, 57642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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-12-06 21:08:55,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18c0f2ba-a37f-4f84-85f6-ff1f330b705e/bin/uautomizer-DrprNOufMa/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