./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:29:59,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:29:59,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:29:59,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:29:59,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:29:59,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:29:59,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:29:59,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:29:59,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:29:59,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:29:59,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:29:59,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:29:59,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:29:59,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:29:59,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:29:59,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:29:59,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:29:59,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:29:59,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:29:59,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:29:59,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:29:59,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:29:59,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:29:59,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:29:59,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:29:59,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:29:59,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:29:59,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:29:59,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:29:59,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:29:59,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:29:59,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:29:59,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:29:59,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:29:59,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:29:59,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:29:59,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:29:59,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:29:59,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:29:59,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:29:59,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:29:59,593 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:29:59,629 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:29:59,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:29:59,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:29:59,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:29:59,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:29:59,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:29:59,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:29:59,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:29:59,636 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:29:59,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:29:59,638 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:29:59,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:29:59,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:29:59,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:29:59,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:29:59,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:29:59,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:29:59,640 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:29:59,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:29:59,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:29:59,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:29:59,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:29:59,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:29:59,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:29:59,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:29:59,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:29:59,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:29:59,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:29:59,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:29:59,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:29:59,645 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:29:59,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:29:59,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:29:59,646 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_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/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_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8 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 ! call(reach_error())) ) 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2022-11-16 12:29:59,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:29:59,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:29:59,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:29:59,988 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:29:59,988 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:29:59,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-16 12:30:00,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/data/7a99ae3d6/3644a8ac41d74e34b0d8ebc5a2ca7e0b/FLAGa9f5a6e3a [2022-11-16 12:30:00,614 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:30:00,614 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-16 12:30:00,635 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/data/7a99ae3d6/3644a8ac41d74e34b0d8ebc5a2ca7e0b/FLAGa9f5a6e3a [2022-11-16 12:30:00,933 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/data/7a99ae3d6/3644a8ac41d74e34b0d8ebc5a2ca7e0b [2022-11-16 12:30:00,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:30:00,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:30:00,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:30:00,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:30:00,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:30:00,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:00" (1/1) ... [2022-11-16 12:30:00,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7236f962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:00, skipping insertion in model container [2022-11-16 12:30:00,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:00" (1/1) ... [2022-11-16 12:30:00,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:30:01,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:30:01,225 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-16 12:30:01,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:30:01,490 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:30:01,503 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-16 12:30:01,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:30:01,614 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:30:01,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01 WrapperNode [2022-11-16 12:30:01,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:30:01,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:30:01,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:30:01,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:30:01,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,679 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-16 12:30:01,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:30:01,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:30:01,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:30:01,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:30:01,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,707 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:30:01,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:30:01,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:30:01,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:30:01,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (1/1) ... [2022-11-16 12:30:01,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:30:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:30:01,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:30:01,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:30:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:30:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:30:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:30:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:30:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:30:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:30:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:30:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:30:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:30:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 12:30:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 12:30:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:30:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:30:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:30:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:30:01,797 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:30:02,048 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:30:02,050 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:30:02,429 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:30:02,586 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:30:02,586 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:30:02,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:02 BoogieIcfgContainer [2022-11-16 12:30:02,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:30:02,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:30:02,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:30:02,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:30:02,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:00" (1/3) ... [2022-11-16 12:30:02,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c7be51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:02, skipping insertion in model container [2022-11-16 12:30:02,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:01" (2/3) ... [2022-11-16 12:30:02,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c7be51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:02, skipping insertion in model container [2022-11-16 12:30:02,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:02" (3/3) ... [2022-11-16 12:30:02,603 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-16 12:30:02,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:30:02,626 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:30:02,626 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:30:02,627 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:30:02,718 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:30:02,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-11-16 12:30:02,823 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-11-16 12:30:02,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:30:02,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-16 12:30:02,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-11-16 12:30:02,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-11-16 12:30:02,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:30:02,849 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5370397d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:30:02,849 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 12:30:02,867 INFO L130 PetriNetUnfolder]: 0/71 cut-off events. [2022-11-16 12:30:02,868 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:30:02,868 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:02,868 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:02,869 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:02,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:02,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2144898314, now seen corresponding path program 1 times [2022-11-16 12:30:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:02,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161082473] [2022-11-16 12:30:02,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:03,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161082473] [2022-11-16 12:30:03,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161082473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:03,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:03,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:30:03,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958672863] [2022-11-16 12:30:03,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:03,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:30:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:03,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:30:03,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:30:03,654 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 113 [2022-11-16 12:30:03,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:03,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:03,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 113 [2022-11-16 12:30:03,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:03,883 INFO L130 PetriNetUnfolder]: 17/242 cut-off events. [2022-11-16 12:30:03,884 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 12:30:03,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 242 events. 17/242 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 739 event pairs, 7 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 243. Up to 27 conditions per place. [2022-11-16 12:30:03,889 INFO L137 encePairwiseOnDemand]: 108/113 looper letters, 10 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2022-11-16 12:30:03,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 251 flow [2022-11-16 12:30:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:30:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:30:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-16 12:30:03,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2022-11-16 12:30:03,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-16 12:30:03,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-16 12:30:03,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:03,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-16 12:30:03,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:03,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:03,940 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:03,942 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 229 flow. Second operand 3 states and 317 transitions. [2022-11-16 12:30:03,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 251 flow [2022-11-16 12:30:03,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 12:30:03,955 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 222 flow [2022-11-16 12:30:03,958 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2022-11-16 12:30:03,963 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2022-11-16 12:30:03,964 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 222 flow [2022-11-16 12:30:03,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:03,965 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:03,965 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:03,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:30:03,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash 273349602, now seen corresponding path program 1 times [2022-11-16 12:30:03,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:03,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498594255] [2022-11-16 12:30:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:05,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:05,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498594255] [2022-11-16 12:30:05,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498594255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:05,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:05,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:30:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331039588] [2022-11-16 12:30:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:05,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:30:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:30:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:05,102 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-11-16 12:30:05,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:05,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:05,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-11-16 12:30:05,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:06,585 INFO L130 PetriNetUnfolder]: 951/2919 cut-off events. [2022-11-16 12:30:06,585 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-11-16 12:30:06,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4633 conditions, 2919 events. 951/2919 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 24622 event pairs, 99 based on Foata normal form. 0/2834 useless extension candidates. Maximal degree in co-relation 4574. Up to 684 conditions per place. [2022-11-16 12:30:06,615 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 36 selfloop transitions, 10 changer transitions 81/195 dead transitions. [2022-11-16 12:30:06,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 195 transitions, 660 flow [2022-11-16 12:30:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:30:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:30:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1185 transitions. [2022-11-16 12:30:06,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8066712049012934 [2022-11-16 12:30:06,622 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1185 transitions. [2022-11-16 12:30:06,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1185 transitions. [2022-11-16 12:30:06,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:06,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1185 transitions. [2022-11-16 12:30:06,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.15384615384616) internal successors, (1185), 13 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:06,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:06,635 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:06,636 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 222 flow. Second operand 13 states and 1185 transitions. [2022-11-16 12:30:06,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 195 transitions, 660 flow [2022-11-16 12:30:06,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 195 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:30:06,644 INFO L231 Difference]: Finished difference. Result has 136 places, 102 transitions, 299 flow [2022-11-16 12:30:06,645 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=299, PETRI_PLACES=136, PETRI_TRANSITIONS=102} [2022-11-16 12:30:06,646 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 18 predicate places. [2022-11-16 12:30:06,647 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 102 transitions, 299 flow [2022-11-16 12:30:06,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:06,648 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:06,648 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:06,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:30:06,649 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 826660225, now seen corresponding path program 1 times [2022-11-16 12:30:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:06,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594547766] [2022-11-16 12:30:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:07,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:07,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594547766] [2022-11-16 12:30:07,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594547766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:07,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:07,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:30:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196922209] [2022-11-16 12:30:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:07,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:30:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:07,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:30:07,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:30:07,743 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-16 12:30:07,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 102 transitions, 299 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:07,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:07,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-16 12:30:07,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:08,388 INFO L130 PetriNetUnfolder]: 464/1182 cut-off events. [2022-11-16 12:30:08,389 INFO L131 PetriNetUnfolder]: For 2405/2916 co-relation queries the response was YES. [2022-11-16 12:30:08,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3892 conditions, 1182 events. 464/1182 cut-off events. For 2405/2916 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7861 event pairs, 94 based on Foata normal form. 32/1168 useless extension candidates. Maximal degree in co-relation 3827. Up to 495 conditions per place. [2022-11-16 12:30:08,401 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 33 selfloop transitions, 17 changer transitions 33/163 dead transitions. [2022-11-16 12:30:08,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 163 transitions, 848 flow [2022-11-16 12:30:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:30:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 12:30:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1413 transitions. [2022-11-16 12:30:08,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8336283185840708 [2022-11-16 12:30:08,406 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1413 transitions. [2022-11-16 12:30:08,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1413 transitions. [2022-11-16 12:30:08,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:08,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1413 transitions. [2022-11-16 12:30:08,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 94.2) internal successors, (1413), 15 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:08,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:08,417 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:08,418 INFO L175 Difference]: Start difference. First operand has 136 places, 102 transitions, 299 flow. Second operand 15 states and 1413 transitions. [2022-11-16 12:30:08,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 163 transitions, 848 flow [2022-11-16 12:30:08,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 163 transitions, 800 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-16 12:30:08,434 INFO L231 Difference]: Finished difference. Result has 133 places, 113 transitions, 438 flow [2022-11-16 12:30:08,434 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=438, PETRI_PLACES=133, PETRI_TRANSITIONS=113} [2022-11-16 12:30:08,435 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 15 predicate places. [2022-11-16 12:30:08,435 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 113 transitions, 438 flow [2022-11-16 12:30:08,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:08,436 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:08,436 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:08,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:30:08,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:08,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash -197755577, now seen corresponding path program 1 times [2022-11-16 12:30:08,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:08,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172788362] [2022-11-16 12:30:08,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172788362] [2022-11-16 12:30:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172788362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:08,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:08,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:30:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627625151] [2022-11-16 12:30:08,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:08,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:30:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:30:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:08,927 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-11-16 12:30:08,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 113 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:08,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:08,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-11-16 12:30:08,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:09,542 INFO L130 PetriNetUnfolder]: 523/1369 cut-off events. [2022-11-16 12:30:09,542 INFO L131 PetriNetUnfolder]: For 4112/4653 co-relation queries the response was YES. [2022-11-16 12:30:09,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5035 conditions, 1369 events. 523/1369 cut-off events. For 4112/4653 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9668 event pairs, 171 based on Foata normal form. 20/1335 useless extension candidates. Maximal degree in co-relation 4963. Up to 574 conditions per place. [2022-11-16 12:30:09,560 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 32 selfloop transitions, 15 changer transitions 40/169 dead transitions. [2022-11-16 12:30:09,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 169 transitions, 1046 flow [2022-11-16 12:30:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:30:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:30:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1252 transitions. [2022-11-16 12:30:09,565 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.852280462899932 [2022-11-16 12:30:09,565 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1252 transitions. [2022-11-16 12:30:09,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1252 transitions. [2022-11-16 12:30:09,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:09,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1252 transitions. [2022-11-16 12:30:09,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.3076923076923) internal successors, (1252), 13 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:09,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:09,581 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:09,581 INFO L175 Difference]: Start difference. First operand has 133 places, 113 transitions, 438 flow. Second operand 13 states and 1252 transitions. [2022-11-16 12:30:09,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 169 transitions, 1046 flow [2022-11-16 12:30:09,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 169 transitions, 971 flow, removed 26 selfloop flow, removed 6 redundant places. [2022-11-16 12:30:09,599 INFO L231 Difference]: Finished difference. Result has 146 places, 119 transitions, 513 flow [2022-11-16 12:30:09,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=513, PETRI_PLACES=146, PETRI_TRANSITIONS=119} [2022-11-16 12:30:09,601 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 28 predicate places. [2022-11-16 12:30:09,603 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 119 transitions, 513 flow [2022-11-16 12:30:09,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:09,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:09,604 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:09,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:30:09,605 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -947340771, now seen corresponding path program 2 times [2022-11-16 12:30:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192042494] [2022-11-16 12:30:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:10,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:10,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192042494] [2022-11-16 12:30:10,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192042494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:10,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:10,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:30:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029966953] [2022-11-16 12:30:10,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:10,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:30:10,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:30:10,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:30:10,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 113 [2022-11-16 12:30:10,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 119 transitions, 513 flow. Second operand has 9 states, 9 states have (on average 87.88888888888889) internal successors, (791), 9 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:10,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:10,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 113 [2022-11-16 12:30:10,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:11,433 INFO L130 PetriNetUnfolder]: 774/1887 cut-off events. [2022-11-16 12:30:11,434 INFO L131 PetriNetUnfolder]: For 10009/12886 co-relation queries the response was YES. [2022-11-16 12:30:11,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8043 conditions, 1887 events. 774/1887 cut-off events. For 10009/12886 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13544 event pairs, 203 based on Foata normal form. 34/1879 useless extension candidates. Maximal degree in co-relation 7962. Up to 868 conditions per place. [2022-11-16 12:30:11,455 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 43 selfloop transitions, 23 changer transitions 94/232 dead transitions. [2022-11-16 12:30:11,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 232 transitions, 1871 flow [2022-11-16 12:30:11,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:30:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-16 12:30:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1736 transitions. [2022-11-16 12:30:11,460 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.808570097810899 [2022-11-16 12:30:11,460 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1736 transitions. [2022-11-16 12:30:11,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1736 transitions. [2022-11-16 12:30:11,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:11,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1736 transitions. [2022-11-16 12:30:11,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 91.36842105263158) internal successors, (1736), 19 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:11,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 113.0) internal successors, (2260), 20 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:11,471 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 113.0) internal successors, (2260), 20 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:11,471 INFO L175 Difference]: Start difference. First operand has 146 places, 119 transitions, 513 flow. Second operand 19 states and 1736 transitions. [2022-11-16 12:30:11,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 232 transitions, 1871 flow [2022-11-16 12:30:11,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 232 transitions, 1756 flow, removed 40 selfloop flow, removed 7 redundant places. [2022-11-16 12:30:11,506 INFO L231 Difference]: Finished difference. Result has 163 places, 122 transitions, 651 flow [2022-11-16 12:30:11,506 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=651, PETRI_PLACES=163, PETRI_TRANSITIONS=122} [2022-11-16 12:30:11,507 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 45 predicate places. [2022-11-16 12:30:11,507 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 122 transitions, 651 flow [2022-11-16 12:30:11,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.88888888888889) internal successors, (791), 9 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:11,508 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:11,508 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:11,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:30:11,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash -147064032, now seen corresponding path program 1 times [2022-11-16 12:30:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:11,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158853014] [2022-11-16 12:30:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:13,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158853014] [2022-11-16 12:30:13,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158853014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:13,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:13,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:30:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862872945] [2022-11-16 12:30:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:13,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:30:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:30:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:30:13,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-16 12:30:13,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 122 transitions, 651 flow. Second operand has 14 states, 14 states have (on average 88.35714285714286) internal successors, (1237), 14 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:13,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:13,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-16 12:30:13,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:13,798 INFO L130 PetriNetUnfolder]: 356/1052 cut-off events. [2022-11-16 12:30:13,798 INFO L131 PetriNetUnfolder]: For 10290/10948 co-relation queries the response was YES. [2022-11-16 12:30:13,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4950 conditions, 1052 events. 356/1052 cut-off events. For 10290/10948 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6710 event pairs, 111 based on Foata normal form. 29/1034 useless extension candidates. Maximal degree in co-relation 4855. Up to 377 conditions per place. [2022-11-16 12:30:13,815 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 28 selfloop transitions, 18 changer transitions 19/146 dead transitions. [2022-11-16 12:30:13,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 146 transitions, 1021 flow [2022-11-16 12:30:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:30:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 12:30:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1347 transitions. [2022-11-16 12:30:13,820 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7946902654867256 [2022-11-16 12:30:13,821 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1347 transitions. [2022-11-16 12:30:13,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1347 transitions. [2022-11-16 12:30:13,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:13,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1347 transitions. [2022-11-16 12:30:13,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 89.8) internal successors, (1347), 15 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:13,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:13,829 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:13,830 INFO L175 Difference]: Start difference. First operand has 163 places, 122 transitions, 651 flow. Second operand 15 states and 1347 transitions. [2022-11-16 12:30:13,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 146 transitions, 1021 flow [2022-11-16 12:30:13,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 146 transitions, 912 flow, removed 44 selfloop flow, removed 12 redundant places. [2022-11-16 12:30:13,866 INFO L231 Difference]: Finished difference. Result has 154 places, 122 transitions, 637 flow [2022-11-16 12:30:13,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=637, PETRI_PLACES=154, PETRI_TRANSITIONS=122} [2022-11-16 12:30:13,870 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 36 predicate places. [2022-11-16 12:30:13,870 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 122 transitions, 637 flow [2022-11-16 12:30:13,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 88.35714285714286) internal successors, (1237), 14 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:13,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:13,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:13,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:30:13,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash -48962431, now seen corresponding path program 1 times [2022-11-16 12:30:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:13,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131880887] [2022-11-16 12:30:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:15,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131880887] [2022-11-16 12:30:15,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131880887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:15,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:15,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:30:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276223050] [2022-11-16 12:30:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:15,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:30:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:15,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:30:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:30:15,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-11-16 12:30:15,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 122 transitions, 637 flow. Second operand has 11 states, 11 states have (on average 83.9090909090909) internal successors, (923), 11 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:15,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:15,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-11-16 12:30:15,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:17,079 INFO L130 PetriNetUnfolder]: 599/1497 cut-off events. [2022-11-16 12:30:17,079 INFO L131 PetriNetUnfolder]: For 11923/14020 co-relation queries the response was YES. [2022-11-16 12:30:17,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7251 conditions, 1497 events. 599/1497 cut-off events. For 11923/14020 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9707 event pairs, 58 based on Foata normal form. 45/1496 useless extension candidates. Maximal degree in co-relation 7152. Up to 488 conditions per place. [2022-11-16 12:30:17,103 INFO L137 encePairwiseOnDemand]: 96/113 looper letters, 41 selfloop transitions, 34 changer transitions 49/192 dead transitions. [2022-11-16 12:30:17,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 192 transitions, 1660 flow [2022-11-16 12:30:17,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:30:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 12:30:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1325 transitions. [2022-11-16 12:30:17,108 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7817109144542773 [2022-11-16 12:30:17,108 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1325 transitions. [2022-11-16 12:30:17,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1325 transitions. [2022-11-16 12:30:17,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:17,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1325 transitions. [2022-11-16 12:30:17,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.33333333333333) internal successors, (1325), 15 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:17,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:17,117 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:17,118 INFO L175 Difference]: Start difference. First operand has 154 places, 122 transitions, 637 flow. Second operand 15 states and 1325 transitions. [2022-11-16 12:30:17,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 192 transitions, 1660 flow [2022-11-16 12:30:17,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 192 transitions, 1574 flow, removed 24 selfloop flow, removed 14 redundant places. [2022-11-16 12:30:17,144 INFO L231 Difference]: Finished difference. Result has 157 places, 131 transitions, 835 flow [2022-11-16 12:30:17,144 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=835, PETRI_PLACES=157, PETRI_TRANSITIONS=131} [2022-11-16 12:30:17,145 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 39 predicate places. [2022-11-16 12:30:17,145 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 131 transitions, 835 flow [2022-11-16 12:30:17,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 83.9090909090909) internal successors, (923), 11 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:17,146 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:17,146 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:17,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:30:17,147 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash -839310173, now seen corresponding path program 2 times [2022-11-16 12:30:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070264020] [2022-11-16 12:30:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:18,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070264020] [2022-11-16 12:30:18,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070264020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:18,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:18,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:30:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647521348] [2022-11-16 12:30:18,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:18,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:30:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:30:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:30:18,471 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 113 [2022-11-16 12:30:18,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 131 transitions, 835 flow. Second operand has 11 states, 11 states have (on average 84.81818181818181) internal successors, (933), 11 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:18,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:18,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 113 [2022-11-16 12:30:18,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:19,399 INFO L130 PetriNetUnfolder]: 636/1516 cut-off events. [2022-11-16 12:30:19,399 INFO L131 PetriNetUnfolder]: For 19774/22807 co-relation queries the response was YES. [2022-11-16 12:30:19,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 1516 events. 636/1516 cut-off events. For 19774/22807 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9756 event pairs, 80 based on Foata normal form. 49/1516 useless extension candidates. Maximal degree in co-relation 8945. Up to 575 conditions per place. [2022-11-16 12:30:19,421 INFO L137 encePairwiseOnDemand]: 99/113 looper letters, 76 selfloop transitions, 32 changer transitions 80/257 dead transitions. [2022-11-16 12:30:19,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 257 transitions, 2960 flow [2022-11-16 12:30:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:30:19,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 12:30:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1517 transitions. [2022-11-16 12:30:19,425 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7896928682977615 [2022-11-16 12:30:19,426 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1517 transitions. [2022-11-16 12:30:19,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1517 transitions. [2022-11-16 12:30:19,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:19,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1517 transitions. [2022-11-16 12:30:19,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 89.23529411764706) internal successors, (1517), 17 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:19,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:19,435 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 113.0) internal successors, (2034), 18 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:19,435 INFO L175 Difference]: Start difference. First operand has 157 places, 131 transitions, 835 flow. Second operand 17 states and 1517 transitions. [2022-11-16 12:30:19,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 257 transitions, 2960 flow [2022-11-16 12:30:19,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 257 transitions, 2814 flow, removed 65 selfloop flow, removed 7 redundant places. [2022-11-16 12:30:19,478 INFO L231 Difference]: Finished difference. Result has 172 places, 149 transitions, 1188 flow [2022-11-16 12:30:19,478 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1188, PETRI_PLACES=172, PETRI_TRANSITIONS=149} [2022-11-16 12:30:19,479 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 54 predicate places. [2022-11-16 12:30:19,479 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 149 transitions, 1188 flow [2022-11-16 12:30:19,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.81818181818181) internal successors, (933), 11 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:19,480 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:19,480 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:19,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:30:19,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:19,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1335944275, now seen corresponding path program 3 times [2022-11-16 12:30:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:19,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532921709] [2022-11-16 12:30:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:20,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:20,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532921709] [2022-11-16 12:30:20,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532921709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:20,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:20,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:30:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255410133] [2022-11-16 12:30:20,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:20,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:30:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:30:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:30:20,355 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-11-16 12:30:20,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 149 transitions, 1188 flow. Second operand has 12 states, 12 states have (on average 89.41666666666667) internal successors, (1073), 12 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:20,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:20,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-11-16 12:30:20,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:20,978 INFO L130 PetriNetUnfolder]: 448/1216 cut-off events. [2022-11-16 12:30:20,979 INFO L131 PetriNetUnfolder]: For 24164/29611 co-relation queries the response was YES. [2022-11-16 12:30:20,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8034 conditions, 1216 events. 448/1216 cut-off events. For 24164/29611 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7855 event pairs, 76 based on Foata normal form. 71/1232 useless extension candidates. Maximal degree in co-relation 7926. Up to 443 conditions per place. [2022-11-16 12:30:21,010 INFO L137 encePairwiseOnDemand]: 101/113 looper letters, 38 selfloop transitions, 28 changer transitions 31/188 dead transitions. [2022-11-16 12:30:21,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 188 transitions, 1993 flow [2022-11-16 12:30:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:30:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 12:30:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1285 transitions. [2022-11-16 12:30:21,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8122629582806574 [2022-11-16 12:30:21,014 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1285 transitions. [2022-11-16 12:30:21,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1285 transitions. [2022-11-16 12:30:21,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:21,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1285 transitions. [2022-11-16 12:30:21,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 91.78571428571429) internal successors, (1285), 14 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:21,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:21,021 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:21,021 INFO L175 Difference]: Start difference. First operand has 172 places, 149 transitions, 1188 flow. Second operand 14 states and 1285 transitions. [2022-11-16 12:30:21,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 188 transitions, 1993 flow [2022-11-16 12:30:21,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 188 transitions, 1835 flow, removed 77 selfloop flow, removed 8 redundant places. [2022-11-16 12:30:21,072 INFO L231 Difference]: Finished difference. Result has 175 places, 152 transitions, 1229 flow [2022-11-16 12:30:21,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1229, PETRI_PLACES=175, PETRI_TRANSITIONS=152} [2022-11-16 12:30:21,074 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 57 predicate places. [2022-11-16 12:30:21,074 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 152 transitions, 1229 flow [2022-11-16 12:30:21,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.41666666666667) internal successors, (1073), 12 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:21,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:21,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:21,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:30:21,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1467324305, now seen corresponding path program 1 times [2022-11-16 12:30:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:21,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368601095] [2022-11-16 12:30:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:22,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368601095] [2022-11-16 12:30:22,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368601095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:22,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:22,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:30:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851305965] [2022-11-16 12:30:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:22,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:30:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:30:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:30:22,058 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 113 [2022-11-16 12:30:22,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 152 transitions, 1229 flow. Second operand has 10 states, 10 states have (on average 88.9) internal successors, (889), 10 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:22,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:22,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 113 [2022-11-16 12:30:22,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:22,677 INFO L130 PetriNetUnfolder]: 409/1159 cut-off events. [2022-11-16 12:30:22,677 INFO L131 PetriNetUnfolder]: For 23263/25747 co-relation queries the response was YES. [2022-11-16 12:30:22,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7722 conditions, 1159 events. 409/1159 cut-off events. For 23263/25747 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7346 event pairs, 63 based on Foata normal form. 61/1162 useless extension candidates. Maximal degree in co-relation 7608. Up to 443 conditions per place. [2022-11-16 12:30:22,699 INFO L137 encePairwiseOnDemand]: 102/113 looper letters, 44 selfloop transitions, 28 changer transitions 31/193 dead transitions. [2022-11-16 12:30:22,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 193 transitions, 2292 flow [2022-11-16 12:30:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 12:30:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 12:30:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1096 transitions. [2022-11-16 12:30:22,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8082595870206489 [2022-11-16 12:30:22,703 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1096 transitions. [2022-11-16 12:30:22,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1096 transitions. [2022-11-16 12:30:22,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:22,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1096 transitions. [2022-11-16 12:30:22,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.33333333333333) internal successors, (1096), 12 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:22,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:22,709 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 113.0) internal successors, (1469), 13 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:22,710 INFO L175 Difference]: Start difference. First operand has 175 places, 152 transitions, 1229 flow. Second operand 12 states and 1096 transitions. [2022-11-16 12:30:22,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 193 transitions, 2292 flow [2022-11-16 12:30:22,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 193 transitions, 2220 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-11-16 12:30:22,756 INFO L231 Difference]: Finished difference. Result has 178 places, 157 transitions, 1398 flow [2022-11-16 12:30:22,757 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1398, PETRI_PLACES=178, PETRI_TRANSITIONS=157} [2022-11-16 12:30:22,758 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 60 predicate places. [2022-11-16 12:30:22,758 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 157 transitions, 1398 flow [2022-11-16 12:30:22,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.9) internal successors, (889), 10 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:22,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:22,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:22,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:30:22,759 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -134892801, now seen corresponding path program 2 times [2022-11-16 12:30:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688880819] [2022-11-16 12:30:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:23,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688880819] [2022-11-16 12:30:23,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688880819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:23,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:23,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:30:23,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35750478] [2022-11-16 12:30:23,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:23,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:30:23,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:30:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:30:23,255 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-16 12:30:23,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 157 transitions, 1398 flow. Second operand has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:23,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:23,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-16 12:30:23,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:23,997 INFO L130 PetriNetUnfolder]: 384/1085 cut-off events. [2022-11-16 12:30:23,997 INFO L131 PetriNetUnfolder]: For 31259/37607 co-relation queries the response was YES. [2022-11-16 12:30:24,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8125 conditions, 1085 events. 384/1085 cut-off events. For 31259/37607 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6804 event pairs, 59 based on Foata normal form. 49/1075 useless extension candidates. Maximal degree in co-relation 8014. Up to 423 conditions per place. [2022-11-16 12:30:24,014 INFO L137 encePairwiseOnDemand]: 104/113 looper letters, 47 selfloop transitions, 28 changer transitions 31/200 dead transitions. [2022-11-16 12:30:24,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 200 transitions, 2735 flow [2022-11-16 12:30:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:30:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 12:30:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1048 transitions. [2022-11-16 12:30:24,017 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8431214802896219 [2022-11-16 12:30:24,018 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1048 transitions. [2022-11-16 12:30:24,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1048 transitions. [2022-11-16 12:30:24,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:24,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1048 transitions. [2022-11-16 12:30:24,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.27272727272727) internal successors, (1048), 11 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:24,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:24,040 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 113.0) internal successors, (1356), 12 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:24,041 INFO L175 Difference]: Start difference. First operand has 178 places, 157 transitions, 1398 flow. Second operand 11 states and 1048 transitions. [2022-11-16 12:30:24,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 200 transitions, 2735 flow [2022-11-16 12:30:24,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 200 transitions, 2600 flow, removed 43 selfloop flow, removed 10 redundant places. [2022-11-16 12:30:24,123 INFO L231 Difference]: Finished difference. Result has 179 places, 161 transitions, 1549 flow [2022-11-16 12:30:24,124 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1549, PETRI_PLACES=179, PETRI_TRANSITIONS=161} [2022-11-16 12:30:24,124 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 61 predicate places. [2022-11-16 12:30:24,125 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 161 transitions, 1549 flow [2022-11-16 12:30:24,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.875) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:24,126 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:24,126 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:24,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:30:24,127 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1451971104, now seen corresponding path program 1 times [2022-11-16 12:30:24,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:24,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700792443] [2022-11-16 12:30:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:24,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:24,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:24,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700792443] [2022-11-16 12:30:24,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700792443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:24,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:24,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 12:30:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065867951] [2022-11-16 12:30:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:24,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:30:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:24,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:30:24,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:30:24,977 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 113 [2022-11-16 12:30:24,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 161 transitions, 1549 flow. Second operand has 13 states, 13 states have (on average 90.38461538461539) internal successors, (1175), 13 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:24,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:24,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 113 [2022-11-16 12:30:24,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:25,580 INFO L130 PetriNetUnfolder]: 346/1036 cut-off events. [2022-11-16 12:30:25,580 INFO L131 PetriNetUnfolder]: For 29519/36820 co-relation queries the response was YES. [2022-11-16 12:30:25,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7545 conditions, 1036 events. 346/1036 cut-off events. For 29519/36820 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6558 event pairs, 32 based on Foata normal form. 85/1066 useless extension candidates. Maximal degree in co-relation 7431. Up to 406 conditions per place. [2022-11-16 12:30:25,600 INFO L137 encePairwiseOnDemand]: 100/113 looper letters, 47 selfloop transitions, 49 changer transitions 13/201 dead transitions. [2022-11-16 12:30:25,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 2670 flow [2022-11-16 12:30:25,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:30:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 12:30:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1382 transitions. [2022-11-16 12:30:25,606 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8153392330383481 [2022-11-16 12:30:25,606 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1382 transitions. [2022-11-16 12:30:25,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1382 transitions. [2022-11-16 12:30:25,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:25,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1382 transitions. [2022-11-16 12:30:25,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 92.13333333333334) internal successors, (1382), 15 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:25,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:25,613 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:25,613 INFO L175 Difference]: Start difference. First operand has 179 places, 161 transitions, 1549 flow. Second operand 15 states and 1382 transitions. [2022-11-16 12:30:25,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 2670 flow [2022-11-16 12:30:25,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 201 transitions, 2469 flow, removed 79 selfloop flow, removed 9 redundant places. [2022-11-16 12:30:25,699 INFO L231 Difference]: Finished difference. Result has 186 places, 179 transitions, 2076 flow [2022-11-16 12:30:25,699 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2076, PETRI_PLACES=186, PETRI_TRANSITIONS=179} [2022-11-16 12:30:25,701 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 68 predicate places. [2022-11-16 12:30:25,701 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 179 transitions, 2076 flow [2022-11-16 12:30:25,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.38461538461539) internal successors, (1175), 13 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:25,702 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:25,702 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:25,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:30:25,703 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1224137410, now seen corresponding path program 2 times [2022-11-16 12:30:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:25,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398632563] [2022-11-16 12:30:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:27,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398632563] [2022-11-16 12:30:27,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398632563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:27,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:27,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:30:27,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953575751] [2022-11-16 12:30:27,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:27,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:30:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:27,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:30:27,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:30:27,038 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 113 [2022-11-16 12:30:27,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 179 transitions, 2076 flow. Second operand has 12 states, 12 states have (on average 83.0) internal successors, (996), 12 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:27,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:27,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 113 [2022-11-16 12:30:27,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:28,360 INFO L130 PetriNetUnfolder]: 405/1231 cut-off events. [2022-11-16 12:30:28,360 INFO L131 PetriNetUnfolder]: For 28091/51949 co-relation queries the response was YES. [2022-11-16 12:30:28,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8660 conditions, 1231 events. 405/1231 cut-off events. For 28091/51949 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8257 event pairs, 22 based on Foata normal form. 57/1230 useless extension candidates. Maximal degree in co-relation 8537. Up to 440 conditions per place. [2022-11-16 12:30:28,380 INFO L137 encePairwiseOnDemand]: 97/113 looper letters, 76 selfloop transitions, 73 changer transitions 28/244 dead transitions. [2022-11-16 12:30:28,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 244 transitions, 3581 flow [2022-11-16 12:30:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:30:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-11-16 12:30:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1543 transitions. [2022-11-16 12:30:28,384 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7586037364798427 [2022-11-16 12:30:28,385 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1543 transitions. [2022-11-16 12:30:28,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1543 transitions. [2022-11-16 12:30:28,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:28,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1543 transitions. [2022-11-16 12:30:28,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.72222222222223) internal successors, (1543), 18 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:28,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:28,393 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 113.0) internal successors, (2147), 19 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:28,393 INFO L175 Difference]: Start difference. First operand has 186 places, 179 transitions, 2076 flow. Second operand 18 states and 1543 transitions. [2022-11-16 12:30:28,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 244 transitions, 3581 flow [2022-11-16 12:30:28,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 244 transitions, 3301 flow, removed 119 selfloop flow, removed 12 redundant places. [2022-11-16 12:30:28,480 INFO L231 Difference]: Finished difference. Result has 199 places, 200 transitions, 2557 flow [2022-11-16 12:30:28,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2557, PETRI_PLACES=199, PETRI_TRANSITIONS=200} [2022-11-16 12:30:28,481 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 81 predicate places. [2022-11-16 12:30:28,481 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 200 transitions, 2557 flow [2022-11-16 12:30:28,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 83.0) internal successors, (996), 12 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:28,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:28,482 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:28,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:30:28,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash -653039136, now seen corresponding path program 3 times [2022-11-16 12:30:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:28,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700781994] [2022-11-16 12:30:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:29,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700781994] [2022-11-16 12:30:29,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700781994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:29,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:29,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 12:30:29,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693559204] [2022-11-16 12:30:29,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:29,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:30:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:29,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:30:29,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:30:29,599 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 113 [2022-11-16 12:30:29,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 200 transitions, 2557 flow. Second operand has 14 states, 14 states have (on average 86.57142857142857) internal successors, (1212), 14 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:29,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:29,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 113 [2022-11-16 12:30:29,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:30,324 INFO L130 PetriNetUnfolder]: 368/1163 cut-off events. [2022-11-16 12:30:30,325 INFO L131 PetriNetUnfolder]: For 30814/41172 co-relation queries the response was YES. [2022-11-16 12:30:30,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 1163 events. 368/1163 cut-off events. For 30814/41172 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7868 event pairs, 44 based on Foata normal form. 112/1210 useless extension candidates. Maximal degree in co-relation 8492. Up to 444 conditions per place. [2022-11-16 12:30:30,348 INFO L137 encePairwiseOnDemand]: 100/113 looper letters, 72 selfloop transitions, 35 changer transitions 13/219 dead transitions. [2022-11-16 12:30:30,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 219 transitions, 3247 flow [2022-11-16 12:30:30,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:30:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-16 12:30:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1319 transitions. [2022-11-16 12:30:30,352 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7781710914454277 [2022-11-16 12:30:30,352 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1319 transitions. [2022-11-16 12:30:30,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1319 transitions. [2022-11-16 12:30:30,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:30,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1319 transitions. [2022-11-16 12:30:30,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 87.93333333333334) internal successors, (1319), 15 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:30,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:30,359 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 113.0) internal successors, (1808), 16 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:30,359 INFO L175 Difference]: Start difference. First operand has 199 places, 200 transitions, 2557 flow. Second operand 15 states and 1319 transitions. [2022-11-16 12:30:30,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 219 transitions, 3247 flow [2022-11-16 12:30:30,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 219 transitions, 3076 flow, removed 68 selfloop flow, removed 13 redundant places. [2022-11-16 12:30:30,476 INFO L231 Difference]: Finished difference. Result has 198 places, 202 transitions, 2611 flow [2022-11-16 12:30:30,476 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2434, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2611, PETRI_PLACES=198, PETRI_TRANSITIONS=202} [2022-11-16 12:30:30,478 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 80 predicate places. [2022-11-16 12:30:30,478 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 202 transitions, 2611 flow [2022-11-16 12:30:30,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.57142857142857) internal successors, (1212), 14 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:30,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:30,479 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:30,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:30:30,479 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:30,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash 797317706, now seen corresponding path program 1 times [2022-11-16 12:30:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:30,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575157426] [2022-11-16 12:30:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:30,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:30,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575157426] [2022-11-16 12:30:30,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575157426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:30,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:30,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:30:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804811370] [2022-11-16 12:30:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:30,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:30:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:30:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:30:30,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-16 12:30:30,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 202 transitions, 2611 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:30,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:30,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-16 12:30:30,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:32,072 INFO L130 PetriNetUnfolder]: 2531/4980 cut-off events. [2022-11-16 12:30:32,072 INFO L131 PetriNetUnfolder]: For 168577/175361 co-relation queries the response was YES. [2022-11-16 12:30:32,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31895 conditions, 4980 events. 2531/4980 cut-off events. For 168577/175361 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 39090 event pairs, 85 based on Foata normal form. 996/5785 useless extension candidates. Maximal degree in co-relation 31770. Up to 1688 conditions per place. [2022-11-16 12:30:32,146 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 170 selfloop transitions, 13 changer transitions 161/448 dead transitions. [2022-11-16 12:30:32,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 448 transitions, 8756 flow [2022-11-16 12:30:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:30:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 12:30:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 974 transitions. [2022-11-16 12:30:32,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8619469026548673 [2022-11-16 12:30:32,149 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 974 transitions. [2022-11-16 12:30:32,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 974 transitions. [2022-11-16 12:30:32,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:32,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 974 transitions. [2022-11-16 12:30:32,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.4) internal successors, (974), 10 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:32,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:32,154 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 113.0) internal successors, (1243), 11 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:32,154 INFO L175 Difference]: Start difference. First operand has 198 places, 202 transitions, 2611 flow. Second operand 10 states and 974 transitions. [2022-11-16 12:30:32,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 448 transitions, 8756 flow [2022-11-16 12:30:32,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 448 transitions, 8415 flow, removed 81 selfloop flow, removed 13 redundant places. [2022-11-16 12:30:32,481 INFO L231 Difference]: Finished difference. Result has 194 places, 194 transitions, 2234 flow [2022-11-16 12:30:32,482 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2234, PETRI_PLACES=194, PETRI_TRANSITIONS=194} [2022-11-16 12:30:32,482 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 76 predicate places. [2022-11-16 12:30:32,482 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 194 transitions, 2234 flow [2022-11-16 12:30:32,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:32,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:32,483 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:32,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:30:32,483 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:32,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:32,485 INFO L85 PathProgramCache]: Analyzing trace with hash -611011292, now seen corresponding path program 1 times [2022-11-16 12:30:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:32,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077337238] [2022-11-16 12:30:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:33,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077337238] [2022-11-16 12:30:33,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077337238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:33,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:33,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-16 12:30:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131278542] [2022-11-16 12:30:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:33,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:30:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:33,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:30:33,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:30:33,328 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 113 [2022-11-16 12:30:33,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 194 transitions, 2234 flow. Second operand has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:33,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:33,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 113 [2022-11-16 12:30:33,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:34,068 INFO L130 PetriNetUnfolder]: 510/2271 cut-off events. [2022-11-16 12:30:34,068 INFO L131 PetriNetUnfolder]: For 26819/30985 co-relation queries the response was YES. [2022-11-16 12:30:34,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10634 conditions, 2271 events. 510/2271 cut-off events. For 26819/30985 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22695 event pairs, 110 based on Foata normal form. 212/2330 useless extension candidates. Maximal degree in co-relation 10507. Up to 400 conditions per place. [2022-11-16 12:30:34,106 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 70 selfloop transitions, 36 changer transitions 0/214 dead transitions. [2022-11-16 12:30:34,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 214 transitions, 2838 flow [2022-11-16 12:30:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:30:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:30:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1186 transitions. [2022-11-16 12:30:34,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.807351940095303 [2022-11-16 12:30:34,111 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1186 transitions. [2022-11-16 12:30:34,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1186 transitions. [2022-11-16 12:30:34,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:34,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1186 transitions. [2022-11-16 12:30:34,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.23076923076923) internal successors, (1186), 13 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:34,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:34,118 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:34,119 INFO L175 Difference]: Start difference. First operand has 194 places, 194 transitions, 2234 flow. Second operand 13 states and 1186 transitions. [2022-11-16 12:30:34,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 214 transitions, 2838 flow [2022-11-16 12:30:34,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 214 transitions, 2801 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-11-16 12:30:34,215 INFO L231 Difference]: Finished difference. Result has 211 places, 205 transitions, 2609 flow [2022-11-16 12:30:34,216 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=2209, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2609, PETRI_PLACES=211, PETRI_TRANSITIONS=205} [2022-11-16 12:30:34,216 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 93 predicate places. [2022-11-16 12:30:34,217 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 205 transitions, 2609 flow [2022-11-16 12:30:34,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.72727272727273) internal successors, (987), 11 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:34,217 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:34,218 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:34,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:30:34,218 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1007643180, now seen corresponding path program 1 times [2022-11-16 12:30:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:34,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477694062] [2022-11-16 12:30:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:34,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477694062] [2022-11-16 12:30:34,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477694062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:34,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:34,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:30:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077131977] [2022-11-16 12:30:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:34,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:30:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:30:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:34,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-16 12:30:34,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 205 transitions, 2609 flow. Second operand has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:34,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:34,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-16 12:30:34,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:35,750 INFO L130 PetriNetUnfolder]: 2327/5017 cut-off events. [2022-11-16 12:30:35,750 INFO L131 PetriNetUnfolder]: For 140465/146254 co-relation queries the response was YES. [2022-11-16 12:30:35,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32190 conditions, 5017 events. 2327/5017 cut-off events. For 140465/146254 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 43668 event pairs, 66 based on Foata normal form. 1033/5964 useless extension candidates. Maximal degree in co-relation 32059. Up to 1438 conditions per place. [2022-11-16 12:30:35,904 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 127 selfloop transitions, 26 changer transitions 189/441 dead transitions. [2022-11-16 12:30:35,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 441 transitions, 8708 flow [2022-11-16 12:30:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:30:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:30:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1264 transitions. [2022-11-16 12:30:35,908 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8604492852280463 [2022-11-16 12:30:35,908 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1264 transitions. [2022-11-16 12:30:35,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1264 transitions. [2022-11-16 12:30:35,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:35,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1264 transitions. [2022-11-16 12:30:35,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 97.23076923076923) internal successors, (1264), 13 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:35,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:35,915 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 113.0) internal successors, (1582), 14 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:35,915 INFO L175 Difference]: Start difference. First operand has 211 places, 205 transitions, 2609 flow. Second operand 13 states and 1264 transitions. [2022-11-16 12:30:35,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 441 transitions, 8708 flow [2022-11-16 12:30:36,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 441 transitions, 7790 flow, removed 282 selfloop flow, removed 17 redundant places. [2022-11-16 12:30:36,266 INFO L231 Difference]: Finished difference. Result has 210 places, 183 transitions, 1835 flow [2022-11-16 12:30:36,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1835, PETRI_PLACES=210, PETRI_TRANSITIONS=183} [2022-11-16 12:30:36,267 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 92 predicate places. [2022-11-16 12:30:36,267 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 183 transitions, 1835 flow [2022-11-16 12:30:36,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:36,268 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:36,268 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:36,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:30:36,268 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:36,269 INFO L85 PathProgramCache]: Analyzing trace with hash 447581943, now seen corresponding path program 1 times [2022-11-16 12:30:36,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:36,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251333911] [2022-11-16 12:30:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:36,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:36,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251333911] [2022-11-16 12:30:36,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251333911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:36,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:36,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:30:36,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546244015] [2022-11-16 12:30:36,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:36,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:30:36,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:30:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:30:36,516 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 113 [2022-11-16 12:30:36,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 183 transitions, 1835 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:36,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:36,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 113 [2022-11-16 12:30:36,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:37,298 INFO L130 PetriNetUnfolder]: 837/3732 cut-off events. [2022-11-16 12:30:37,298 INFO L131 PetriNetUnfolder]: For 23718/24270 co-relation queries the response was YES. [2022-11-16 12:30:37,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14600 conditions, 3732 events. 837/3732 cut-off events. For 23718/24270 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 44045 event pairs, 18 based on Foata normal form. 48/3587 useless extension candidates. Maximal degree in co-relation 14476. Up to 979 conditions per place. [2022-11-16 12:30:37,337 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 65 selfloop transitions, 1 changer transitions 69/249 dead transitions. [2022-11-16 12:30:37,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 249 transitions, 3495 flow [2022-11-16 12:30:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:30:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:30:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 677 transitions. [2022-11-16 12:30:37,340 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8558786346396966 [2022-11-16 12:30:37,340 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 677 transitions. [2022-11-16 12:30:37,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 677 transitions. [2022-11-16 12:30:37,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:37,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 677 transitions. [2022-11-16 12:30:37,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:37,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:37,344 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:37,345 INFO L175 Difference]: Start difference. First operand has 210 places, 183 transitions, 1835 flow. Second operand 7 states and 677 transitions. [2022-11-16 12:30:37,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 249 transitions, 3495 flow [2022-11-16 12:30:37,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 249 transitions, 3254 flow, removed 84 selfloop flow, removed 14 redundant places. [2022-11-16 12:30:37,698 INFO L231 Difference]: Finished difference. Result has 201 places, 163 transitions, 1376 flow [2022-11-16 12:30:37,699 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1376, PETRI_PLACES=201, PETRI_TRANSITIONS=163} [2022-11-16 12:30:37,699 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 83 predicate places. [2022-11-16 12:30:37,699 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 163 transitions, 1376 flow [2022-11-16 12:30:37,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:37,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:37,700 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:37,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:30:37,700 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:37,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2037961335, now seen corresponding path program 2 times [2022-11-16 12:30:37,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:37,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544730199] [2022-11-16 12:30:37,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544730199] [2022-11-16 12:30:37,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544730199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:37,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:37,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:30:37,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65801093] [2022-11-16 12:30:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:37,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:30:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:37,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:30:37,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:30:37,972 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 113 [2022-11-16 12:30:37,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 163 transitions, 1376 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:37,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:37,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 113 [2022-11-16 12:30:37,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:38,632 INFO L130 PetriNetUnfolder]: 514/2468 cut-off events. [2022-11-16 12:30:38,633 INFO L131 PetriNetUnfolder]: For 11190/11273 co-relation queries the response was YES. [2022-11-16 12:30:38,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7608 conditions, 2468 events. 514/2468 cut-off events. For 11190/11273 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 27009 event pairs, 16 based on Foata normal form. 29/2382 useless extension candidates. Maximal degree in co-relation 7489. Up to 295 conditions per place. [2022-11-16 12:30:38,659 INFO L137 encePairwiseOnDemand]: 107/113 looper letters, 39 selfloop transitions, 4 changer transitions 38/192 dead transitions. [2022-11-16 12:30:38,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 192 transitions, 2216 flow [2022-11-16 12:30:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:30:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:30:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2022-11-16 12:30:38,663 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.855457227138643 [2022-11-16 12:30:38,663 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 870 transitions. [2022-11-16 12:30:38,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 870 transitions. [2022-11-16 12:30:38,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:38,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 870 transitions. [2022-11-16 12:30:38,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.66666666666667) internal successors, (870), 9 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:38,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:38,669 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:38,670 INFO L175 Difference]: Start difference. First operand has 201 places, 163 transitions, 1376 flow. Second operand 9 states and 870 transitions. [2022-11-16 12:30:38,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 192 transitions, 2216 flow [2022-11-16 12:30:38,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 192 transitions, 2051 flow, removed 54 selfloop flow, removed 16 redundant places. [2022-11-16 12:30:38,757 INFO L231 Difference]: Finished difference. Result has 196 places, 149 transitions, 1039 flow [2022-11-16 12:30:38,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=196, PETRI_TRANSITIONS=149} [2022-11-16 12:30:38,758 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 78 predicate places. [2022-11-16 12:30:38,759 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 149 transitions, 1039 flow [2022-11-16 12:30:38,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:38,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:38,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:38,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:30:38,760 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:38,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1242704737, now seen corresponding path program 1 times [2022-11-16 12:30:38,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:38,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719229302] [2022-11-16 12:30:38,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:38,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:30:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:30:39,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719229302] [2022-11-16 12:30:39,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719229302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:30:39,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:30:39,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:30:39,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997827845] [2022-11-16 12:30:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:30:39,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:30:39,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:30:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:30:39,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:30:39,081 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-11-16 12:30:39,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 149 transitions, 1039 flow. Second operand has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:39,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:30:39,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-11-16 12:30:39,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:30:39,976 INFO L130 PetriNetUnfolder]: 956/3137 cut-off events. [2022-11-16 12:30:39,977 INFO L131 PetriNetUnfolder]: For 41230/42091 co-relation queries the response was YES. [2022-11-16 12:30:39,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13907 conditions, 3137 events. 956/3137 cut-off events. For 41230/42091 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 32495 event pairs, 27 based on Foata normal form. 294/3392 useless extension candidates. Maximal degree in co-relation 13844. Up to 443 conditions per place. [2022-11-16 12:30:39,996 INFO L137 encePairwiseOnDemand]: 103/113 looper letters, 20 selfloop transitions, 12 changer transitions 143/250 dead transitions. [2022-11-16 12:30:39,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 250 transitions, 3040 flow [2022-11-16 12:30:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:30:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-16 12:30:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1520 transitions. [2022-11-16 12:30:40,010 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8407079646017699 [2022-11-16 12:30:40,011 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1520 transitions. [2022-11-16 12:30:40,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1520 transitions. [2022-11-16 12:30:40,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:30:40,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1520 transitions. [2022-11-16 12:30:40,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 95.0) internal successors, (1520), 16 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:40,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:40,023 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 113.0) internal successors, (1921), 17 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:40,024 INFO L175 Difference]: Start difference. First operand has 196 places, 149 transitions, 1039 flow. Second operand 16 states and 1520 transitions. [2022-11-16 12:30:40,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 250 transitions, 3040 flow [2022-11-16 12:30:40,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 250 transitions, 2373 flow, removed 295 selfloop flow, removed 25 redundant places. [2022-11-16 12:30:40,117 INFO L231 Difference]: Finished difference. Result has 186 places, 101 transitions, 437 flow [2022-11-16 12:30:40,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=437, PETRI_PLACES=186, PETRI_TRANSITIONS=101} [2022-11-16 12:30:40,118 INFO L288 CegarLoopForPetriNet]: 118 programPoint places, 68 predicate places. [2022-11-16 12:30:40,118 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 101 transitions, 437 flow [2022-11-16 12:30:40,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 92.125) internal successors, (737), 8 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:30:40,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:30:40,118 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:40,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 12:30:40,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 12:30:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:40,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1018580677, now seen corresponding path program 1 times [2022-11-16 12:30:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:30:40,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404511532] [2022-11-16 12:30:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:30:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:30:40,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:30:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:30:40,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:30:40,219 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:30:40,220 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 12:30:40,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 12:30:40,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 12:30:40,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 12:30:40,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 12:30:40,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 12:30:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 12:30:40,225 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:30:40,232 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:30:40,233 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:30:40,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:30:40 BasicIcfg [2022-11-16 12:30:40,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:30:40,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:30:40,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:30:40,330 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:30:40,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:02" (3/4) ... [2022-11-16 12:30:40,340 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:30:40,497 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:30:40,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:30:40,498 INFO L158 Benchmark]: Toolchain (without parser) took 39560.48ms. Allocated memory was 119.5MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 78.1MB in the beginning and 636.4MB in the end (delta: -558.3MB). Peak memory consumption was 324.9MB. Max. memory is 16.1GB. [2022-11-16 12:30:40,499 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 119.5MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:30:40,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 676.26ms. Allocated memory is still 119.5MB. Free memory was 77.9MB in the beginning and 83.1MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:30:40,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.82ms. Allocated memory is still 119.5MB. Free memory was 83.1MB in the beginning and 80.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:30:40,500 INFO L158 Benchmark]: Boogie Preprocessor took 30.83ms. Allocated memory is still 119.5MB. Free memory was 80.5MB in the beginning and 78.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:30:40,500 INFO L158 Benchmark]: RCFGBuilder took 877.27ms. Allocated memory is still 119.5MB. Free memory was 78.6MB in the beginning and 46.9MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 12:30:40,501 INFO L158 Benchmark]: TraceAbstraction took 37738.27ms. Allocated memory was 119.5MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 46.2MB in the beginning and 658.4MB in the end (delta: -612.2MB). Peak memory consumption was 274.5MB. Max. memory is 16.1GB. [2022-11-16 12:30:40,501 INFO L158 Benchmark]: Witness Printer took 167.72ms. Allocated memory is still 1.0GB. Free memory was 658.4MB in the beginning and 636.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-16 12:30:40,503 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.26ms. Allocated memory is still 119.5MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 676.26ms. Allocated memory is still 119.5MB. Free memory was 77.9MB in the beginning and 83.1MB in the end (delta: -5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.82ms. Allocated memory is still 119.5MB. Free memory was 83.1MB in the beginning and 80.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.83ms. Allocated memory is still 119.5MB. Free memory was 80.5MB in the beginning and 78.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 877.27ms. Allocated memory is still 119.5MB. Free memory was 78.6MB in the beginning and 46.9MB in the end (delta: 31.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37738.27ms. Allocated memory was 119.5MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 46.2MB in the beginning and 658.4MB in the end (delta: -612.2MB). Peak memory consumption was 274.5MB. Max. memory is 16.1GB. * Witness Printer took 167.72ms. Allocated memory is still 1.0GB. Free memory was 658.4MB in the beginning and 636.4MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L736] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L737] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L730] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L732] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L719] 0 int y$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L728] 0 _Bool y$read_delayed; VAL [weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1492; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-2, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 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: 37.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1246 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1246 mSDsluCounter, 1440 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1159 mSDsCounter, 210 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2539 IncrementalHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 210 mSolverCounterUnsat, 281 mSDtfsCounter, 2539 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2611occurred in iteration=14, InterpolantAutomatonStates: 263, 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.7s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 1632 NumberOfCodeBlocks, 1632 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1525 ConstructedInterpolants, 0 QuantifiedInterpolants, 10266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 proved your program to be incorrect! [2022-11-16 12:30:40,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f30cd851-cebd-45f9-be82-f6122b6cab38/bin/uautomizer-tPACEb0tL8/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