./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R --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 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 --- 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-38b53e6 [2022-11-25 15:25:44,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:25:44,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:25:44,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:25:44,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:25:44,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:25:44,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:25:44,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:25:44,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:25:44,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:25:44,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:25:44,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:25:44,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:25:44,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:25:44,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:25:44,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:25:44,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:25:44,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:25:44,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:25:44,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:25:44,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:25:44,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:25:44,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:25:44,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:25:44,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:25:44,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:25:44,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:25:44,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:25:44,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:25:44,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:25:44,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:25:44,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:25:44,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:25:44,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:25:44,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:25:44,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:25:44,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:25:44,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:25:44,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:25:44,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:25:44,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:25:44,860 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:25:44,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:25:44,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:25:44,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:25:44,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:25:44,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:25:44,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:25:44,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:25:44,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:25:44,896 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:25:44,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:25:44,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:25:44,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:25:44,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:25:44,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:25:44,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:25:44,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:25:44,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:25:44,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:25:44,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:25:44,899 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:25:44,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:25:44,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:25:44,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:25:44,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:25:44,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:25:44,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:25:44,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:25:44,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:25:44,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:25:44,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:25:44,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:25:44,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:25:44,901 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:25:44,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:25:44,902 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/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_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R 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 -> 473191b5f1326a38296af26dcd2c7f553c42833f82b512e9fb358484309bc769 [2022-11-25 15:25:45,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:25:45,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:25:45,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:25:45,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:25:45,239 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:25:45,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 15:25:48,283 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:25:48,555 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:25:48,555 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 15:25:48,570 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/data/df68e1670/ad544f7a1c6046b78eea246f70615c49/FLAGbbde0925e [2022-11-25 15:25:48,585 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/data/df68e1670/ad544f7a1c6046b78eea246f70615c49 [2022-11-25 15:25:48,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:25:48,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:25:48,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:25:48,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:25:48,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:25:48,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:25:48" (1/1) ... [2022-11-25 15:25:48,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bed246e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:48, skipping insertion in model container [2022-11-25 15:25:48,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:25:48" (1/1) ... [2022-11-25 15:25:48,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:25:48,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:25:48,901 WARN L237 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_103c9522-73ae-4164-b2ea-16acfed2ed3f/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 15:25:49,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:25:49,168 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:25:49,180 WARN L237 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_103c9522-73ae-4164-b2ea-16acfed2ed3f/sv-benchmarks/c/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 15:25:49,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:25:49,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:25:49,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:25:49,285 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:25:49,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49 WrapperNode [2022-11-25 15:25:49,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:25:49,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:25:49,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:25:49,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:25:49,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,355 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-11-25 15:25:49,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:25:49,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:25:49,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:25:49,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:25:49,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,382 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:25:49,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:25:49,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:25:49,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:25:49,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (1/1) ... [2022-11-25 15:25:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:25:49,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:25:49,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:25:49,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:25:49,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:25:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:25:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:25:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:25:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:25:49,488 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:25:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:25:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:25:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:25:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:25:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:25:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 15:25:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 15:25:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:25:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:25:49,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:25:49,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:25:49,492 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:25:49,702 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:25:49,704 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:25:50,093 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:25:50,394 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:25:50,394 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:25:50,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:25:50 BoogieIcfgContainer [2022-11-25 15:25:50,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:25:50,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:25:50,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:25:50,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:25:50,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:25:48" (1/3) ... [2022-11-25 15:25:50,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18857799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:25:50, skipping insertion in model container [2022-11-25 15:25:50,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:25:49" (2/3) ... [2022-11-25 15:25:50,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18857799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:25:50, skipping insertion in model container [2022-11-25 15:25:50,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:25:50" (3/3) ... [2022-11-25 15:25:50,434 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 15:25:50,444 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:25:50,454 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:25:50,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 15:25:50,454 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:25:50,524 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:25:50,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-11-25 15:25:50,662 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-25 15:25:50,667 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:25:50,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-25 15:25:50,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-11-25 15:25:50,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-11-25 15:25:50,712 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:25:50,739 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-25 15:25:50,747 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-11-25 15:25:50,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-11-25 15:25:50,820 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-25 15:25:50,822 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:25:50,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-25 15:25:50,826 INFO L119 LiptonReduction]: Number of co-enabled transitions 3168 [2022-11-25 15:25:56,355 INFO L134 LiptonReduction]: Checked pairs total: 7741 [2022-11-25 15:25:56,356 INFO L136 LiptonReduction]: Total number of compositions: 114 [2022-11-25 15:25:56,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:25:56,381 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;@7e876511, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:25:56,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 15:25:56,388 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-11-25 15:25:56,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:25:56,389 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:25:56,389 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:25:56,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:25:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:25:56,396 INFO L85 PathProgramCache]: Analyzing trace with hash -983977441, now seen corresponding path program 1 times [2022-11-25 15:25:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:25:56,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377274662] [2022-11-25 15:25:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:25:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:25:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:25:56,976 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-25 15:25:56,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:25:56,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377274662] [2022-11-25 15:25:56,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377274662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:25:56,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:25:56,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:25:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923939747] [2022-11-25 15:25:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:25:56,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:25:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:25:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:25:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:25:57,019 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 250 [2022-11-25 15:25:57,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-25 15:25:57,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:25:57,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 250 [2022-11-25 15:25:57,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:25:57,840 INFO L130 PetriNetUnfolder]: 3113/4532 cut-off events. [2022-11-25 15:25:57,840 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-11-25 15:25:57,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8926 conditions, 4532 events. 3113/4532 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24479 event pairs, 593 based on Foata normal form. 0/4339 useless extension candidates. Maximal degree in co-relation 8914. Up to 3385 conditions per place. [2022-11-25 15:25:57,876 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 32 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2022-11-25 15:25:57,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-11-25 15:25:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:25:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:25:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-11-25 15:25:57,899 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-11-25 15:25:57,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-11-25 15:25:57,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-11-25 15:25:57,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:25:57,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-11-25 15:25:57,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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-25 15:25:57,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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-25 15:25:57,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 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-25 15:25:57,923 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 405 transitions. [2022-11-25 15:25:57,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-11-25 15:25:57,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 15:25:57,934 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2022-11-25 15:25:57,936 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-11-25 15:25:57,940 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-11-25 15:25:57,940 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2022-11-25 15:25:57,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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-25 15:25:57,941 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:25:57,941 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:25:57,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:25:57,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:25:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:25:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -517805111, now seen corresponding path program 1 times [2022-11-25 15:25:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:25:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497225439] [2022-11-25 15:25:57,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:25:57,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:25:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:25:58,634 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-25 15:25:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:25:58,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497225439] [2022-11-25 15:25:58,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497225439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:25:58,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:25:58,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:25:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842173117] [2022-11-25 15:25:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:25:58,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:25:58,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:25:58,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:25:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:25:58,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2022-11-25 15:25:58,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-25 15:25:58,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:25:58,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2022-11-25 15:25:58,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:01,146 INFO L130 PetriNetUnfolder]: 10670/14783 cut-off events. [2022-11-25 15:26:01,147 INFO L131 PetriNetUnfolder]: For 604/604 co-relation queries the response was YES. [2022-11-25 15:26:01,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30376 conditions, 14783 events. 10670/14783 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 80006 event pairs, 1381 based on Foata normal form. 662/15443 useless extension candidates. Maximal degree in co-relation 30366. Up to 7965 conditions per place. [2022-11-25 15:26:01,252 INFO L137 encePairwiseOnDemand]: 237/250 looper letters, 53 selfloop transitions, 13 changer transitions 41/108 dead transitions. [2022-11-25 15:26:01,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 108 transitions, 462 flow [2022-11-25 15:26:01,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:26:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:26:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2022-11-25 15:26:01,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4948571428571429 [2022-11-25 15:26:01,255 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2022-11-25 15:26:01,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2022-11-25 15:26:01,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:01,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2022-11-25 15:26:01,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 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-25 15:26:01,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:01,263 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:01,263 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 7 states and 866 transitions. [2022-11-25 15:26:01,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 108 transitions, 462 flow [2022-11-25 15:26:01,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 108 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:26:01,268 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 182 flow [2022-11-25 15:26:01,268 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-11-25 15:26:01,269 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-11-25 15:26:01,269 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 182 flow [2022-11-25 15:26:01,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-25 15:26:01,270 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:01,270 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:26:01,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1127900162, now seen corresponding path program 1 times [2022-11-25 15:26:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:01,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283515920] [2022-11-25 15:26:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:01,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:01,617 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-25 15:26:01,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:01,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283515920] [2022-11-25 15:26:01,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283515920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:01,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:01,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:26:01,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015159350] [2022-11-25 15:26:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:01,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:26:01,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:01,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:26:01,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:26:01,636 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 250 [2022-11-25 15:26:01,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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-25 15:26:01,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:01,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 250 [2022-11-25 15:26:01,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:03,461 INFO L130 PetriNetUnfolder]: 7495/10871 cut-off events. [2022-11-25 15:26:03,461 INFO L131 PetriNetUnfolder]: For 12298/12509 co-relation queries the response was YES. [2022-11-25 15:26:03,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33350 conditions, 10871 events. 7495/10871 cut-off events. For 12298/12509 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 62778 event pairs, 1695 based on Foata normal form. 556/11331 useless extension candidates. Maximal degree in co-relation 33334. Up to 5875 conditions per place. [2022-11-25 15:26:03,565 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 42 selfloop transitions, 3 changer transitions 26/79 dead transitions. [2022-11-25 15:26:03,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 500 flow [2022-11-25 15:26:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:26:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:26:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-11-25 15:26:03,568 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5224 [2022-11-25 15:26:03,568 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 653 transitions. [2022-11-25 15:26:03,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 653 transitions. [2022-11-25 15:26:03,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:03,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 653 transitions. [2022-11-25 15:26:03,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.6) internal successors, (653), 5 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-25 15:26:03,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:03,574 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:03,574 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 182 flow. Second operand 5 states and 653 transitions. [2022-11-25 15:26:03,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 500 flow [2022-11-25 15:26:03,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 498 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 15:26:03,632 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 195 flow [2022-11-25 15:26:03,632 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-11-25 15:26:03,634 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-11-25 15:26:03,634 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 195 flow [2022-11-25 15:26:03,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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-25 15:26:03,635 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:03,635 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:03,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:26:03,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1972809427, now seen corresponding path program 1 times [2022-11-25 15:26:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:03,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539618285] [2022-11-25 15:26:03,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:03,884 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-25 15:26:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539618285] [2022-11-25 15:26:03,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539618285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:03,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:03,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:26:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55486445] [2022-11-25 15:26:03,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:03,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:26:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:03,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:26:03,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:26:03,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-11-25 15:26:03,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 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-25 15:26:03,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:03,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-11-25 15:26:03,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:05,374 INFO L130 PetriNetUnfolder]: 7501/11004 cut-off events. [2022-11-25 15:26:05,375 INFO L131 PetriNetUnfolder]: For 16015/16024 co-relation queries the response was YES. [2022-11-25 15:26:05,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34226 conditions, 11004 events. 7501/11004 cut-off events. For 16015/16024 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 64772 event pairs, 1548 based on Foata normal form. 360/11218 useless extension candidates. Maximal degree in co-relation 34206. Up to 8508 conditions per place. [2022-11-25 15:26:05,478 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 51 selfloop transitions, 5 changer transitions 25/87 dead transitions. [2022-11-25 15:26:05,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 585 flow [2022-11-25 15:26:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:26:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:26:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-11-25 15:26:05,481 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5232 [2022-11-25 15:26:05,481 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-11-25 15:26:05,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-11-25 15:26:05,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:05,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-11-25 15:26:05,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 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-25 15:26:05,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:05,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:05,487 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 195 flow. Second operand 5 states and 654 transitions. [2022-11-25 15:26:05,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 585 flow [2022-11-25 15:26:05,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 571 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 15:26:05,558 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 246 flow [2022-11-25 15:26:05,559 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-11-25 15:26:05,560 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2022-11-25 15:26:05,561 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 246 flow [2022-11-25 15:26:05,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 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-25 15:26:05,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:05,562 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:05,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:26:05,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:05,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:05,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1025764545, now seen corresponding path program 1 times [2022-11-25 15:26:05,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:05,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134223430] [2022-11-25 15:26:05,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:05,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:05,811 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-25 15:26:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:05,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134223430] [2022-11-25 15:26:05,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134223430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:05,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:05,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:26:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336267870] [2022-11-25 15:26:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:05,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:26:05,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:05,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:26:05,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:26:05,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-11-25 15:26:05,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 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-25 15:26:05,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:05,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-11-25 15:26:05,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:07,723 INFO L130 PetriNetUnfolder]: 9045/13010 cut-off events. [2022-11-25 15:26:07,723 INFO L131 PetriNetUnfolder]: For 21911/21920 co-relation queries the response was YES. [2022-11-25 15:26:07,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43018 conditions, 13010 events. 9045/13010 cut-off events. For 21911/21920 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 76426 event pairs, 3447 based on Foata normal form. 288/12990 useless extension candidates. Maximal degree in co-relation 42997. Up to 6228 conditions per place. [2022-11-25 15:26:07,807 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 52 selfloop transitions, 6 changer transitions 21/85 dead transitions. [2022-11-25 15:26:07,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 596 flow [2022-11-25 15:26:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:26:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:26:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-11-25 15:26:07,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5232 [2022-11-25 15:26:07,811 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-11-25 15:26:07,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-11-25 15:26:07,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:07,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-11-25 15:26:07,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 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-25 15:26:07,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:07,817 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:07,817 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 246 flow. Second operand 5 states and 654 transitions. [2022-11-25 15:26:07,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 596 flow [2022-11-25 15:26:07,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 577 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-25 15:26:07,868 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 257 flow [2022-11-25 15:26:07,869 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-11-25 15:26:07,870 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2022-11-25 15:26:07,870 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 257 flow [2022-11-25 15:26:07,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 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-25 15:26:07,870 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:07,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:07,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:26:07,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:07,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash -93514153, now seen corresponding path program 1 times [2022-11-25 15:26:07,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:07,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869346317] [2022-11-25 15:26:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:07,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:08,708 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-25 15:26:08,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:08,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869346317] [2022-11-25 15:26:08,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869346317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:08,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:08,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:26:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103464435] [2022-11-25 15:26:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:08,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:26:08,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:26:08,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:26:08,759 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 250 [2022-11-25 15:26:08,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 257 flow. Second operand has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 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-25 15:26:08,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:08,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 250 [2022-11-25 15:26:08,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:10,606 INFO L130 PetriNetUnfolder]: 11982/17462 cut-off events. [2022-11-25 15:26:10,606 INFO L131 PetriNetUnfolder]: For 37471/37882 co-relation queries the response was YES. [2022-11-25 15:26:10,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57201 conditions, 17462 events. 11982/17462 cut-off events. For 37471/37882 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 106370 event pairs, 2000 based on Foata normal form. 707/18062 useless extension candidates. Maximal degree in co-relation 57178. Up to 11187 conditions per place. [2022-11-25 15:26:10,887 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 78 selfloop transitions, 15 changer transitions 28/130 dead transitions. [2022-11-25 15:26:10,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 932 flow [2022-11-25 15:26:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:26:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:26:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1029 transitions. [2022-11-25 15:26:10,892 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5145 [2022-11-25 15:26:10,892 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1029 transitions. [2022-11-25 15:26:10,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1029 transitions. [2022-11-25 15:26:10,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:10,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1029 transitions. [2022-11-25 15:26:10,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.625) internal successors, (1029), 8 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:26:10,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 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-25 15:26:10,900 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 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-25 15:26:10,900 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 257 flow. Second operand 8 states and 1029 transitions. [2022-11-25 15:26:10,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 932 flow [2022-11-25 15:26:11,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 130 transitions, 899 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-11-25 15:26:11,088 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 400 flow [2022-11-25 15:26:11,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=400, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-11-25 15:26:11,091 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-11-25 15:26:11,091 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 400 flow [2022-11-25 15:26:11,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 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-25 15:26:11,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:11,092 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:11,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:26:11,093 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:11,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash -27378133, now seen corresponding path program 2 times [2022-11-25 15:26:11,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:11,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666380252] [2022-11-25 15:26:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:11,691 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-25 15:26:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:11,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666380252] [2022-11-25 15:26:11,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666380252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:11,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:11,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:26:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817021168] [2022-11-25 15:26:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:11,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:26:11,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:11,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:26:11,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:26:11,735 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-11-25 15:26:11,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 400 flow. Second operand has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 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-25 15:26:11,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:11,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-11-25 15:26:11,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:13,881 INFO L130 PetriNetUnfolder]: 11614/16943 cut-off events. [2022-11-25 15:26:13,881 INFO L131 PetriNetUnfolder]: For 48556/49372 co-relation queries the response was YES. [2022-11-25 15:26:13,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63773 conditions, 16943 events. 11614/16943 cut-off events. For 48556/49372 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 103139 event pairs, 2309 based on Foata normal form. 1104/17924 useless extension candidates. Maximal degree in co-relation 63746. Up to 11635 conditions per place. [2022-11-25 15:26:14,010 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 69 selfloop transitions, 13 changer transitions 19/110 dead transitions. [2022-11-25 15:26:14,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 110 transitions, 906 flow [2022-11-25 15:26:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:26:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:26:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2022-11-25 15:26:14,014 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.518 [2022-11-25 15:26:14,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2022-11-25 15:26:14,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2022-11-25 15:26:14,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:14,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2022-11-25 15:26:14,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 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-25 15:26:14,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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-25 15:26:14,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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-25 15:26:14,022 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 400 flow. Second operand 6 states and 777 transitions. [2022-11-25 15:26:14,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 110 transitions, 906 flow [2022-11-25 15:26:14,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 904 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 15:26:14,128 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 511 flow [2022-11-25 15:26:14,128 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2022-11-25 15:26:14,129 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2022-11-25 15:26:14,129 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 511 flow [2022-11-25 15:26:14,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 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-25 15:26:14,130 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:14,130 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:14,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:26:14,130 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash 184311331, now seen corresponding path program 1 times [2022-11-25 15:26:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:14,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044559381] [2022-11-25 15:26:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:14,780 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-25 15:26:14,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:14,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044559381] [2022-11-25 15:26:14,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044559381] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:14,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:14,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:26:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229770000] [2022-11-25 15:26:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:14,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:26:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:14,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:26:14,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:26:14,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-11-25 15:26:14,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 511 flow. Second operand has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 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-25 15:26:14,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:14,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-11-25 15:26:14,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:16,855 INFO L130 PetriNetUnfolder]: 11721/17110 cut-off events. [2022-11-25 15:26:16,855 INFO L131 PetriNetUnfolder]: For 61446/62101 co-relation queries the response was YES. [2022-11-25 15:26:16,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69056 conditions, 17110 events. 11721/17110 cut-off events. For 61446/62101 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 103837 event pairs, 2391 based on Foata normal form. 587/17525 useless extension candidates. Maximal degree in co-relation 69024. Up to 11594 conditions per place. [2022-11-25 15:26:17,012 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 79 selfloop transitions, 21 changer transitions 19/128 dead transitions. [2022-11-25 15:26:17,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 128 transitions, 1149 flow [2022-11-25 15:26:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:26:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:26:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2022-11-25 15:26:17,016 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.516 [2022-11-25 15:26:17,016 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2022-11-25 15:26:17,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2022-11-25 15:26:17,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:17,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2022-11-25 15:26:17,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:26:17,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:17,025 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:17,025 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 511 flow. Second operand 7 states and 903 transitions. [2022-11-25 15:26:17,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 128 transitions, 1149 flow [2022-11-25 15:26:17,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 1141 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-25 15:26:17,204 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 687 flow [2022-11-25 15:26:17,204 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=687, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2022-11-25 15:26:17,205 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2022-11-25 15:26:17,205 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 687 flow [2022-11-25 15:26:17,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 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-25 15:26:17,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:17,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:17,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:26:17,207 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash 250447351, now seen corresponding path program 2 times [2022-11-25 15:26:17,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:17,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94001689] [2022-11-25 15:26:17,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:17,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:18,021 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-25 15:26:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:18,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94001689] [2022-11-25 15:26:18,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94001689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:18,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:18,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:26:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163794524] [2022-11-25 15:26:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:18,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:26:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:18,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:26:18,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:26:18,149 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 250 [2022-11-25 15:26:18,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 687 flow. Second operand has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 0 states have call successors, (0), 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-25 15:26:18,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:18,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 250 [2022-11-25 15:26:18,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:20,721 INFO L130 PetriNetUnfolder]: 15969/22334 cut-off events. [2022-11-25 15:26:20,721 INFO L131 PetriNetUnfolder]: For 97427/97427 co-relation queries the response was YES. [2022-11-25 15:26:20,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98197 conditions, 22334 events. 15969/22334 cut-off events. For 97427/97427 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 124362 event pairs, 1654 based on Foata normal form. 440/22774 useless extension candidates. Maximal degree in co-relation 98160. Up to 11345 conditions per place. [2022-11-25 15:26:20,895 INFO L137 encePairwiseOnDemand]: 236/250 looper letters, 103 selfloop transitions, 71 changer transitions 38/212 dead transitions. [2022-11-25 15:26:20,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 212 transitions, 2104 flow [2022-11-25 15:26:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:26:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:26:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1056 transitions. [2022-11-25 15:26:20,899 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4693333333333333 [2022-11-25 15:26:20,899 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1056 transitions. [2022-11-25 15:26:20,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1056 transitions. [2022-11-25 15:26:20,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:20,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1056 transitions. [2022-11-25 15:26:20,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.33333333333333) internal successors, (1056), 9 states have internal predecessors, (1056), 0 states have call successors, (0), 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-25 15:26:20,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 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-25 15:26:20,908 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 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-25 15:26:20,908 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 687 flow. Second operand 9 states and 1056 transitions. [2022-11-25 15:26:20,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 212 transitions, 2104 flow [2022-11-25 15:26:21,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 212 transitions, 2016 flow, removed 33 selfloop flow, removed 2 redundant places. [2022-11-25 15:26:21,229 INFO L231 Difference]: Finished difference. Result has 85 places, 118 transitions, 1383 flow [2022-11-25 15:26:21,229 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1383, PETRI_PLACES=85, PETRI_TRANSITIONS=118} [2022-11-25 15:26:21,230 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2022-11-25 15:26:21,230 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 118 transitions, 1383 flow [2022-11-25 15:26:21,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 states have internal predecessors, (849), 0 states have call successors, (0), 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-25 15:26:21,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:21,231 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:21,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:26:21,232 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2136507569, now seen corresponding path program 3 times [2022-11-25 15:26:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222180210] [2022-11-25 15:26:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:21,621 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-25 15:26:21,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:21,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222180210] [2022-11-25 15:26:21,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222180210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:21,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:21,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:26:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653622308] [2022-11-25 15:26:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:21,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:26:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:26:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:26:21,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-11-25 15:26:21,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 118 transitions, 1383 flow. Second operand has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:26:21,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:21,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-11-25 15:26:21,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:23,970 INFO L130 PetriNetUnfolder]: 12795/18604 cut-off events. [2022-11-25 15:26:23,970 INFO L131 PetriNetUnfolder]: For 146624/148118 co-relation queries the response was YES. [2022-11-25 15:26:24,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97485 conditions, 18604 events. 12795/18604 cut-off events. For 146624/148118 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 114170 event pairs, 2014 based on Foata normal form. 1356/19743 useless extension candidates. Maximal degree in co-relation 97441. Up to 11719 conditions per place. [2022-11-25 15:26:24,136 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 102 selfloop transitions, 44 changer transitions 11/174 dead transitions. [2022-11-25 15:26:24,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 174 transitions, 2199 flow [2022-11-25 15:26:24,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:26:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:26:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2022-11-25 15:26:24,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5051428571428571 [2022-11-25 15:26:24,141 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2022-11-25 15:26:24,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2022-11-25 15:26:24,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:24,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2022-11-25 15:26:24,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 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-25 15:26:24,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:24,147 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:24,148 INFO L175 Difference]: Start difference. First operand has 85 places, 118 transitions, 1383 flow. Second operand 7 states and 884 transitions. [2022-11-25 15:26:24,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 174 transitions, 2199 flow [2022-11-25 15:26:24,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 174 transitions, 2082 flow, removed 53 selfloop flow, removed 3 redundant places. [2022-11-25 15:26:24,760 INFO L231 Difference]: Finished difference. Result has 88 places, 129 transitions, 1580 flow [2022-11-25 15:26:24,760 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1580, PETRI_PLACES=88, PETRI_TRANSITIONS=129} [2022-11-25 15:26:24,761 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2022-11-25 15:26:24,761 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 129 transitions, 1580 flow [2022-11-25 15:26:24,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:26:24,762 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:24,762 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:24,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:26:24,762 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash 242653160, now seen corresponding path program 1 times [2022-11-25 15:26:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:24,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600928578] [2022-11-25 15:26:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:25,583 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-25 15:26:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600928578] [2022-11-25 15:26:25,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600928578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:25,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:25,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:26:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459725718] [2022-11-25 15:26:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:25,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:26:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:26:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:26:25,641 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 250 [2022-11-25 15:26:25,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 129 transitions, 1580 flow. Second operand has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 0 states have call successors, (0), 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-25 15:26:25,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:25,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 250 [2022-11-25 15:26:25,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:28,449 INFO L130 PetriNetUnfolder]: 13741/19970 cut-off events. [2022-11-25 15:26:28,450 INFO L131 PetriNetUnfolder]: For 153369/155687 co-relation queries the response was YES. [2022-11-25 15:26:28,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107084 conditions, 19970 events. 13741/19970 cut-off events. For 153369/155687 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 124032 event pairs, 1997 based on Foata normal form. 1169/20781 useless extension candidates. Maximal degree in co-relation 107039. Up to 9851 conditions per place. [2022-11-25 15:26:28,605 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 103 selfloop transitions, 52 changer transitions 14/186 dead transitions. [2022-11-25 15:26:28,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 186 transitions, 2388 flow [2022-11-25 15:26:28,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:26:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:26:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2022-11-25 15:26:28,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.512 [2022-11-25 15:26:28,608 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2022-11-25 15:26:28,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2022-11-25 15:26:28,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:28,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2022-11-25 15:26:28,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-25 15:26:28,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:28,615 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:28,615 INFO L175 Difference]: Start difference. First operand has 88 places, 129 transitions, 1580 flow. Second operand 7 states and 896 transitions. [2022-11-25 15:26:28,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 186 transitions, 2388 flow [2022-11-25 15:26:28,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 186 transitions, 2333 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-11-25 15:26:28,912 INFO L231 Difference]: Finished difference. Result has 91 places, 133 transitions, 1776 flow [2022-11-25 15:26:28,913 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1776, PETRI_PLACES=91, PETRI_TRANSITIONS=133} [2022-11-25 15:26:28,913 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2022-11-25 15:26:28,913 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 133 transitions, 1776 flow [2022-11-25 15:26:28,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 0 states have call successors, (0), 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-25 15:26:28,914 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:28,914 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:28,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:26:28,915 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1310160368, now seen corresponding path program 2 times [2022-11-25 15:26:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:28,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122574335] [2022-11-25 15:26:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:29,570 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-25 15:26:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:29,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122574335] [2022-11-25 15:26:29,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122574335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:29,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:29,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:26:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454842061] [2022-11-25 15:26:29,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:29,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:26:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:29,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:26:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:26:29,640 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-11-25 15:26:29,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 133 transitions, 1776 flow. Second operand has 8 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 0 states have call successors, (0), 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-25 15:26:29,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:29,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-11-25 15:26:29,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:33,056 INFO L130 PetriNetUnfolder]: 15071/21920 cut-off events. [2022-11-25 15:26:33,057 INFO L131 PetriNetUnfolder]: For 204267/206925 co-relation queries the response was YES. [2022-11-25 15:26:33,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123262 conditions, 21920 events. 15071/21920 cut-off events. For 204267/206925 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 138909 event pairs, 2770 based on Foata normal form. 1189/22716 useless extension candidates. Maximal degree in co-relation 123216. Up to 9601 conditions per place. [2022-11-25 15:26:33,254 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 119 selfloop transitions, 53 changer transitions 14/203 dead transitions. [2022-11-25 15:26:33,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 203 transitions, 2712 flow [2022-11-25 15:26:33,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:26:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:26:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1033 transitions. [2022-11-25 15:26:33,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5165 [2022-11-25 15:26:33,259 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1033 transitions. [2022-11-25 15:26:33,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1033 transitions. [2022-11-25 15:26:33,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:33,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1033 transitions. [2022-11-25 15:26:33,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.125) internal successors, (1033), 8 states have internal predecessors, (1033), 0 states have call successors, (0), 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-25 15:26:33,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 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-25 15:26:33,267 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 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-25 15:26:33,268 INFO L175 Difference]: Start difference. First operand has 91 places, 133 transitions, 1776 flow. Second operand 8 states and 1033 transitions. [2022-11-25 15:26:33,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 203 transitions, 2712 flow [2022-11-25 15:26:33,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 203 transitions, 2618 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-25 15:26:33,877 INFO L231 Difference]: Finished difference. Result has 95 places, 135 transitions, 1869 flow [2022-11-25 15:26:33,877 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1869, PETRI_PLACES=95, PETRI_TRANSITIONS=135} [2022-11-25 15:26:33,878 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places. [2022-11-25 15:26:33,878 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 135 transitions, 1869 flow [2022-11-25 15:26:33,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 0 states have call successors, (0), 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-25 15:26:33,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:33,879 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:33,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:26:33,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:33,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash -934590308, now seen corresponding path program 3 times [2022-11-25 15:26:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:33,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365684120] [2022-11-25 15:26:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:34,861 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-25 15:26:34,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:34,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365684120] [2022-11-25 15:26:34,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365684120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:34,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:26:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109882052] [2022-11-25 15:26:34,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:34,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:26:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:26:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:26:34,915 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-11-25 15:26:34,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 135 transitions, 1869 flow. Second operand has 8 states, 8 states have (on average 119.25) internal successors, (954), 8 states have internal predecessors, (954), 0 states have call successors, (0), 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-25 15:26:34,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:34,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-11-25 15:26:34,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:38,662 INFO L130 PetriNetUnfolder]: 15375/22459 cut-off events. [2022-11-25 15:26:38,662 INFO L131 PetriNetUnfolder]: For 217532/220261 co-relation queries the response was YES. [2022-11-25 15:26:38,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126254 conditions, 22459 events. 15375/22459 cut-off events. For 217532/220261 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 144646 event pairs, 2984 based on Foata normal form. 1215/23279 useless extension candidates. Maximal degree in co-relation 126207. Up to 12668 conditions per place. [2022-11-25 15:26:38,866 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 126 selfloop transitions, 31 changer transitions 14/188 dead transitions. [2022-11-25 15:26:38,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 188 transitions, 2628 flow [2022-11-25 15:26:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:26:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:26:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2022-11-25 15:26:38,870 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5068571428571429 [2022-11-25 15:26:38,870 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 887 transitions. [2022-11-25 15:26:38,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 887 transitions. [2022-11-25 15:26:38,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:38,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 887 transitions. [2022-11-25 15:26:38,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 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-25 15:26:38,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:38,874 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:38,874 INFO L175 Difference]: Start difference. First operand has 95 places, 135 transitions, 1869 flow. Second operand 7 states and 887 transitions. [2022-11-25 15:26:38,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 188 transitions, 2628 flow [2022-11-25 15:26:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 188 transitions, 2483 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-11-25 15:26:39,378 INFO L231 Difference]: Finished difference. Result has 97 places, 137 transitions, 1872 flow [2022-11-25 15:26:39,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1872, PETRI_PLACES=97, PETRI_TRANSITIONS=137} [2022-11-25 15:26:39,379 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2022-11-25 15:26:39,379 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 137 transitions, 1872 flow [2022-11-25 15:26:39,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.25) internal successors, (954), 8 states have internal predecessors, (954), 0 states have call successors, (0), 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-25 15:26:39,380 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:39,380 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:39,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:26:39,380 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1578941026, now seen corresponding path program 4 times [2022-11-25 15:26:39,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:39,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831403728] [2022-11-25 15:26:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:39,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:40,801 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-25 15:26:40,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:40,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831403728] [2022-11-25 15:26:40,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831403728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:40,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:40,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:26:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957278326] [2022-11-25 15:26:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:40,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:26:40,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:40,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:26:40,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:26:40,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-11-25 15:26:40,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 137 transitions, 1872 flow. Second operand has 8 states, 8 states have (on average 109.25) internal successors, (874), 8 states have internal predecessors, (874), 0 states have call successors, (0), 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-25 15:26:40,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:40,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-11-25 15:26:40,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:45,169 INFO L130 PetriNetUnfolder]: 19423/27434 cut-off events. [2022-11-25 15:26:45,169 INFO L131 PetriNetUnfolder]: For 208909/208909 co-relation queries the response was YES. [2022-11-25 15:26:45,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146132 conditions, 27434 events. 19423/27434 cut-off events. For 208909/208909 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 162411 event pairs, 2499 based on Foata normal form. 272/27706 useless extension candidates. Maximal degree in co-relation 146084. Up to 10597 conditions per place. [2022-11-25 15:26:45,364 INFO L137 encePairwiseOnDemand]: 238/250 looper letters, 158 selfloop transitions, 81 changer transitions 31/270 dead transitions. [2022-11-25 15:26:45,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 270 transitions, 3644 flow [2022-11-25 15:26:45,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:26:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:26:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1074 transitions. [2022-11-25 15:26:45,368 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47733333333333333 [2022-11-25 15:26:45,368 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1074 transitions. [2022-11-25 15:26:45,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1074 transitions. [2022-11-25 15:26:45,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:45,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1074 transitions. [2022-11-25 15:26:45,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 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-25 15:26:45,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 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-25 15:26:45,376 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 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-25 15:26:45,376 INFO L175 Difference]: Start difference. First operand has 97 places, 137 transitions, 1872 flow. Second operand 9 states and 1074 transitions. [2022-11-25 15:26:45,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 270 transitions, 3644 flow [2022-11-25 15:26:46,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 270 transitions, 3518 flow, removed 28 selfloop flow, removed 6 redundant places. [2022-11-25 15:26:46,101 INFO L231 Difference]: Finished difference. Result has 103 places, 175 transitions, 2583 flow [2022-11-25 15:26:46,101 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1784, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2583, PETRI_PLACES=103, PETRI_TRANSITIONS=175} [2022-11-25 15:26:46,102 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2022-11-25 15:26:46,102 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 175 transitions, 2583 flow [2022-11-25 15:26:46,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.25) internal successors, (874), 8 states have internal predecessors, (874), 0 states have call successors, (0), 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-25 15:26:46,103 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:46,103 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:46,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:26:46,103 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash 636551182, now seen corresponding path program 1 times [2022-11-25 15:26:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031770168] [2022-11-25 15:26:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:46,404 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-25 15:26:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031770168] [2022-11-25 15:26:46,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031770168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:46,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:46,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:26:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503249598] [2022-11-25 15:26:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:46,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:26:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:26:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:26:46,418 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250 [2022-11-25 15:26:46,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 175 transitions, 2583 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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-25 15:26:46,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:46,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250 [2022-11-25 15:26:46,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:48,373 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L784-->L791: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff1_thd3~0_20 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_22 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse2 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_83 256) 0))))) (and (= (ite .cse0 0 v_~z$r_buff0_thd3~0_22) v_~z$r_buff0_thd3~0_21) (= (ite (or (and .cse1 (not (= (mod v_~z$w_buff1_used~0_82 256) 0))) (and .cse2 (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0)))) 0 v_~z$r_buff1_thd3~0_20) v_~z$r_buff1_thd3~0_19) (= v_~z$w_buff0_used~0_89 (ite .cse3 0 v_~z$w_buff0_used~0_90)) (= (ite .cse3 v_~z$w_buff0~0_36 (ite .cse4 v_~z$w_buff1~0_31 v_~z~0_58)) v_~z~0_57) (= (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][183], [154#true, 20#L766true, Black: 253#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 359#true, Black: 192#(= ~y~0 1), Black: 250#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 257#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 349#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 259#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 254#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 329#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0)), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, Black: 207#(and (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 128#L791true, Black: 204#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), Black: 273#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 272#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 347#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 248#true, Black: 351#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 339#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 345#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(= ~x~0 0), Black: 343#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 162#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 157#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 16#L855true, Black: 289#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 219#true, 38#L820true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 200#true, Black: 242#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0)), Black: 238#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 237#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), Black: 182#(= ~y~0 0), Black: 185#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 306#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0))]) [2022-11-25 15:26:48,374 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,374 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,374 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,374 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_14 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_21 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3))) (and (= v_~z~0_61 (ite .cse0 v_~z$w_buff0~0_38 (ite .cse1 v_~z$w_buff1~0_33 v_~z~0_62))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_20 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_14) v_~z$r_buff1_thd4~0_13) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94)) (= v_~z$r_buff0_thd4~0_20 (ite .cse4 0 v_~z$r_buff0_thd4~0_21)) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_62} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_61} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][236], [154#true, 20#L766true, Black: 253#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 359#true, Black: 192#(= ~y~0 1), Black: 250#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 257#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 259#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 254#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 329#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0)), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, Black: 207#(and (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 204#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), Black: 273#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 272#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 347#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 336#true, Black: 349#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 248#true, Black: 351#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 339#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 345#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(= ~x~0 0), Black: 343#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 110#L827true, Black: 162#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 157#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 16#L855true, Black: 289#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 219#true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 200#true, Black: 242#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0)), Black: 238#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 237#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 31#L784true, Black: 182#(= ~y~0 0), Black: 185#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 306#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0))]) [2022-11-25 15:26:48,376 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,376 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,376 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,376 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,377 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L855-->L862: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_150 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_160 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_251 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_252 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_228 256) 0)) .cse4))) (and (= v_~z$w_buff0_used~0_251 (ite .cse0 0 v_~z$w_buff0_used~0_252)) (= v_~z$r_buff0_thd0~0_159 (ite .cse1 0 v_~z$r_buff0_thd0~0_160)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_228) v_~z$w_buff1_used~0_227) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| 0)) (= v_~z~0_195 (ite .cse0 v_~z$w_buff0~0_170 (ite .cse2 v_~z$w_buff1~0_152 v_~z~0_196))) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (mod v_~main$tmp_guard0~0_46 256)) (= v_~z$r_buff1_thd0~0_149 (ite (or (and (not (= (mod v_~z$r_buff0_thd0~0_159 256) 0)) .cse3) (and (not (= (mod v_~z$w_buff1_used~0_227 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_150))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_160, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_252, ~z$w_buff0~0=v_~z$w_buff0~0_170, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_150, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ~z$w_buff1~0=v_~z$w_buff1~0_152, ~z~0=v_~z~0_196, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_159, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_251, ~z$w_buff0~0=v_~z$w_buff0~0_170, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_227, ~z$w_buff1~0=v_~z$w_buff1~0_152, ~z~0=v_~z~0_195, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_46, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][184], [308#(and (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0))), 154#true, 20#L766true, Black: 253#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 359#true, Black: 192#(= ~y~0 1), Black: 250#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 257#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 349#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 259#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 254#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 329#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0)), 87#L862true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, Black: 207#(and (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 273#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 272#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 204#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), Black: 347#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 248#true, Black: 351#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 339#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 345#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(= ~x~0 0), Black: 343#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 162#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 157#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 219#true, 38#L820true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, Black: 242#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0)), Black: 238#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 237#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 31#L784true, Black: 182#(= ~y~0 0), Black: 185#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 306#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0))]) [2022-11-25 15:26:48,378 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,378 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,379 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:48,379 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:49,792 INFO L130 PetriNetUnfolder]: 11617/17544 cut-off events. [2022-11-25 15:26:49,793 INFO L131 PetriNetUnfolder]: For 232642/236335 co-relation queries the response was YES. [2022-11-25 15:26:49,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104377 conditions, 17544 events. 11617/17544 cut-off events. For 232642/236335 co-relation queries the response was YES. Maximal size of possible extension queue 1246. Compared 121737 event pairs, 1069 based on Foata normal form. 2970/19965 useless extension candidates. Maximal degree in co-relation 104326. Up to 8306 conditions per place. [2022-11-25 15:26:49,920 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 280 selfloop transitions, 6 changer transitions 0/321 dead transitions. [2022-11-25 15:26:49,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 321 transitions, 5331 flow [2022-11-25 15:26:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:26:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:26:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-11-25 15:26:49,924 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.518 [2022-11-25 15:26:49,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2022-11-25 15:26:49,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2022-11-25 15:26:49,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:49,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2022-11-25 15:26:49,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 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-25 15:26:49,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 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-25 15:26:49,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 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-25 15:26:49,929 INFO L175 Difference]: Start difference. First operand has 103 places, 175 transitions, 2583 flow. Second operand 4 states and 518 transitions. [2022-11-25 15:26:49,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 321 transitions, 5331 flow [2022-11-25 15:26:50,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 321 transitions, 5206 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-11-25 15:26:50,199 INFO L231 Difference]: Finished difference. Result has 103 places, 178 transitions, 2573 flow [2022-11-25 15:26:50,200 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=2479, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2573, PETRI_PLACES=103, PETRI_TRANSITIONS=178} [2022-11-25 15:26:50,200 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2022-11-25 15:26:50,200 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 178 transitions, 2573 flow [2022-11-25 15:26:50,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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-25 15:26:50,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:50,202 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:50,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:26:50,202 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1050150342, now seen corresponding path program 1 times [2022-11-25 15:26:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:50,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214148194] [2022-11-25 15:26:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:50,394 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-25 15:26:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:50,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214148194] [2022-11-25 15:26:50,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214148194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:50,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:50,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:26:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634647129] [2022-11-25 15:26:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:50,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:26:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:26:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:26:50,412 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250 [2022-11-25 15:26:50,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 178 transitions, 2573 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 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-25 15:26:50,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:50,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250 [2022-11-25 15:26:50,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:52,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_14 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_21 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_87 256) 0)) .cse3))) (and (= v_~z~0_61 (ite .cse0 v_~z$w_buff0~0_38 (ite .cse1 v_~z$w_buff1~0_33 v_~z~0_62))) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_20 256) 0)) .cse2) (and (not (= (mod v_~z$w_buff1_used~0_86 256) 0)) .cse3)) 0 v_~z$r_buff1_thd4~0_14) v_~z$r_buff1_thd4~0_13) (= v_~z$w_buff0_used~0_93 (ite .cse0 0 v_~z$w_buff0_used~0_94)) (= v_~z$r_buff0_thd4~0_20 (ite .cse4 0 v_~z$r_buff0_thd4~0_21)) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_87) v_~z$w_buff1_used~0_86)))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_21, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_87, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_62} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_38, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_86, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~z~0=v_~z~0_61} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][153], [154#true, 20#L766true, Black: 253#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 376#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 359#true, Black: 192#(= ~y~0 1), Black: 250#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 257#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 259#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 254#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 329#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0)), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, Black: 207#(and (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 204#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), Black: 273#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 272#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 347#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 349#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), 248#true, Black: 339#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(= ~x~0 0), Black: 345#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 110#L827true, Black: 162#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 157#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 16#L855true, Black: 289#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 219#true, Black: 362#(= ~main$tmp_guard0~0 0), Black: 364#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), Black: 172#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 200#true, Black: 242#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0)), Black: 238#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 237#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), 31#L784true, Black: 182#(= ~y~0 0), Black: 185#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 306#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0))]) [2022-11-25 15:26:52,196 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 15:26:52,197 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:52,197 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:52,197 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 15:26:52,300 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L784-->L791: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff1_thd3~0_20 256) 0))) (.cse2 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd3~0_22 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse2 .cse5)) (.cse4 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_83 256) 0))))) (and (= (ite .cse0 0 v_~z$r_buff0_thd3~0_22) v_~z$r_buff0_thd3~0_21) (= (ite (or (and .cse1 (not (= (mod v_~z$w_buff1_used~0_82 256) 0))) (and .cse2 (not (= (mod v_~z$r_buff0_thd3~0_21 256) 0)))) 0 v_~z$r_buff1_thd3~0_20) v_~z$r_buff1_thd3~0_19) (= v_~z$w_buff0_used~0_89 (ite .cse3 0 v_~z$w_buff0_used~0_90)) (= (ite .cse3 v_~z$w_buff0~0_36 (ite .cse4 v_~z$w_buff1~0_31 v_~z~0_58)) v_~z~0_57) (= (ite (or .cse0 .cse4) 0 v_~z$w_buff1_used~0_83) v_~z$w_buff1_used~0_82)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_83, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_58} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_36, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_82, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~z$w_buff1~0=v_~z$w_buff1~0_31, ~z~0=v_~z~0_57} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0][126], [154#true, 20#L766true, Black: 253#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 359#true, 376#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), Black: 192#(= ~y~0 1), Black: 250#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 349#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z~0)) (= ~z$r_buff1_thd0~0 0)), Black: 257#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 259#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 254#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 329#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (not (<= (+ (div ~z$r_buff0_thd0~0 256) 1) 0)) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0)), P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, Black: 207#(and (not (= ~z$w_buff1~0 2)) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 203#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), Black: 209#(and (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0)), 128#L791true, Black: 204#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~z~0))), Black: 273#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 272#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), Black: 347#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 248#true, Black: 339#(and (<= ~z$w_buff0_used~0 1) (= ~z$w_buff1_used~0 0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 345#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 156#(= ~x~0 0), Black: 162#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), 16#L855true, Black: 157#(and (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))))) (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)))), Black: 289#(and (= ~z$w_buff1~0 0) (= ~z$w_buff0~0 2) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 219#true, Black: 362#(= ~main$tmp_guard0~0 0), Black: 364#(and (= ~__unbuffered_cnt~0 0) (= ~main$tmp_guard0~0 0)), 38#L820true, Black: 172#(= ~__unbuffered_p3_EAX~0 0), 112#P0EXITtrue, 200#true, Black: 242#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~z$r_buff0_thd0~0 0)), Black: 238#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 237#(and (= ~z~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0)), Black: 182#(= ~y~0 0), Black: 185#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 306#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0))]) [2022-11-25 15:26:52,300 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-11-25 15:26:52,300 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 15:26:52,301 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 15:26:52,301 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2022-11-25 15:26:53,284 INFO L130 PetriNetUnfolder]: 8955/13959 cut-off events. [2022-11-25 15:26:53,284 INFO L131 PetriNetUnfolder]: For 201758/206875 co-relation queries the response was YES. [2022-11-25 15:26:53,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87361 conditions, 13959 events. 8955/13959 cut-off events. For 201758/206875 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 99587 event pairs, 695 based on Foata normal form. 3018/16500 useless extension candidates. Maximal degree in co-relation 87309. Up to 6137 conditions per place. [2022-11-25 15:26:53,410 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 307 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2022-11-25 15:26:53,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 350 transitions, 5735 flow [2022-11-25 15:26:53,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:26:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:26:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2022-11-25 15:26:53,414 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-11-25 15:26:53,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2022-11-25 15:26:53,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2022-11-25 15:26:53,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:53,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2022-11-25 15:26:53,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 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-25 15:26:53,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:53,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:26:53,418 INFO L175 Difference]: Start difference. First operand has 103 places, 178 transitions, 2573 flow. Second operand 5 states and 650 transitions. [2022-11-25 15:26:53,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 350 transitions, 5735 flow [2022-11-25 15:26:53,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 350 transitions, 5724 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-25 15:26:53,588 INFO L231 Difference]: Finished difference. Result has 108 places, 163 transitions, 2345 flow [2022-11-25 15:26:53,588 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=2230, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2345, PETRI_PLACES=108, PETRI_TRANSITIONS=163} [2022-11-25 15:26:53,589 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2022-11-25 15:26:53,589 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 163 transitions, 2345 flow [2022-11-25 15:26:53,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 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-25 15:26:53,590 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:53,590 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:53,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:26:53,590 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:53,591 INFO L85 PathProgramCache]: Analyzing trace with hash 275734413, now seen corresponding path program 1 times [2022-11-25 15:26:53,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:53,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2842231] [2022-11-25 15:26:53,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:53,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:53,962 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-25 15:26:53,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:53,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2842231] [2022-11-25 15:26:53,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2842231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:53,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:53,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:26:53,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299389804] [2022-11-25 15:26:53,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:53,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:26:53,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:26:53,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:26:54,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 250 [2022-11-25 15:26:54,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 163 transitions, 2345 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 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-25 15:26:54,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:54,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 250 [2022-11-25 15:26:54,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:26:58,370 INFO L130 PetriNetUnfolder]: 14548/22403 cut-off events. [2022-11-25 15:26:58,370 INFO L131 PetriNetUnfolder]: For 245139/245989 co-relation queries the response was YES. [2022-11-25 15:26:58,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150617 conditions, 22403 events. 14548/22403 cut-off events. For 245139/245989 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 157761 event pairs, 1147 based on Foata normal form. 792/23139 useless extension candidates. Maximal degree in co-relation 150562. Up to 8780 conditions per place. [2022-11-25 15:26:58,514 INFO L137 encePairwiseOnDemand]: 236/250 looper letters, 122 selfloop transitions, 47 changer transitions 192/365 dead transitions. [2022-11-25 15:26:58,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 365 transitions, 5607 flow [2022-11-25 15:26:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:26:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:26:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 849 transitions. [2022-11-25 15:26:58,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48514285714285715 [2022-11-25 15:26:58,517 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 849 transitions. [2022-11-25 15:26:58,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 849 transitions. [2022-11-25 15:26:58,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:26:58,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 849 transitions. [2022-11-25 15:26:58,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 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-25 15:26:58,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:58,522 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:26:58,522 INFO L175 Difference]: Start difference. First operand has 108 places, 163 transitions, 2345 flow. Second operand 7 states and 849 transitions. [2022-11-25 15:26:58,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 365 transitions, 5607 flow [2022-11-25 15:26:58,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 365 transitions, 5546 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-11-25 15:26:58,962 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 1775 flow [2022-11-25 15:26:58,962 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1775, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2022-11-25 15:26:58,962 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 73 predicate places. [2022-11-25 15:26:58,963 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 1775 flow [2022-11-25 15:26:58,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 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-25 15:26:58,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:26:58,963 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:26:58,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:26:58,965 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:26:58,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:26:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1397922319, now seen corresponding path program 1 times [2022-11-25 15:26:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:26:58,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320014126] [2022-11-25 15:26:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:26:58,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:26:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:26:59,427 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-25 15:26:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:26:59,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320014126] [2022-11-25 15:26:59,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320014126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:26:59,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:26:59,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:26:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934692496] [2022-11-25 15:26:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:26:59,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:26:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:26:59,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:26:59,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:26:59,446 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250 [2022-11-25 15:26:59,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 1775 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 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-25 15:26:59,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:26:59,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250 [2022-11-25 15:26:59,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:27:01,012 INFO L130 PetriNetUnfolder]: 5191/8725 cut-off events. [2022-11-25 15:27:01,012 INFO L131 PetriNetUnfolder]: For 128159/130140 co-relation queries the response was YES. [2022-11-25 15:27:01,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55227 conditions, 8725 events. 5191/8725 cut-off events. For 128159/130140 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 65443 event pairs, 467 based on Foata normal form. 1582/10097 useless extension candidates. Maximal degree in co-relation 55169. Up to 3036 conditions per place. [2022-11-25 15:27:01,063 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 202 selfloop transitions, 14 changer transitions 7/245 dead transitions. [2022-11-25 15:27:01,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 245 transitions, 4162 flow [2022-11-25 15:27:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:27:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:27:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 774 transitions. [2022-11-25 15:27:01,065 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.516 [2022-11-25 15:27:01,065 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 774 transitions. [2022-11-25 15:27:01,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 774 transitions. [2022-11-25 15:27:01,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:27:01,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 774 transitions. [2022-11-25 15:27:01,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 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-25 15:27:01,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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-25 15:27:01,070 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 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-25 15:27:01,070 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 1775 flow. Second operand 6 states and 774 transitions. [2022-11-25 15:27:01,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 245 transitions, 4162 flow [2022-11-25 15:27:01,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 245 transitions, 3934 flow, removed 65 selfloop flow, removed 10 redundant places. [2022-11-25 15:27:01,266 INFO L231 Difference]: Finished difference. Result has 110 places, 114 transitions, 1609 flow [2022-11-25 15:27:01,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1609, PETRI_PLACES=110, PETRI_TRANSITIONS=114} [2022-11-25 15:27:01,266 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2022-11-25 15:27:01,267 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 114 transitions, 1609 flow [2022-11-25 15:27:01,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 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-25 15:27:01,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:27:01,267 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] [2022-11-25 15:27:01,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:27:01,267 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:27:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1185150501, now seen corresponding path program 1 times [2022-11-25 15:27:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:01,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825999861] [2022-11-25 15:27:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:01,435 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-25 15:27:01,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:01,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825999861] [2022-11-25 15:27:01,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825999861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:01,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:01,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:27:01,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479370981] [2022-11-25 15:27:01,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:01,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:27:01,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:01,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:27:01,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:27:01,445 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-11-25 15:27:01,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 114 transitions, 1609 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 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-25 15:27:01,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:27:01,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-11-25 15:27:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:27:03,783 INFO L130 PetriNetUnfolder]: 6876/11689 cut-off events. [2022-11-25 15:27:03,783 INFO L131 PetriNetUnfolder]: For 139017/139795 co-relation queries the response was YES. [2022-11-25 15:27:03,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78086 conditions, 11689 events. 6876/11689 cut-off events. For 139017/139795 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 89033 event pairs, 1609 based on Foata normal form. 368/11913 useless extension candidates. Maximal degree in co-relation 78031. Up to 5611 conditions per place. [2022-11-25 15:27:03,854 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 106 selfloop transitions, 9 changer transitions 42/169 dead transitions. [2022-11-25 15:27:03,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 169 transitions, 2622 flow [2022-11-25 15:27:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:27:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:27:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2022-11-25 15:27:03,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.516 [2022-11-25 15:27:03,856 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2022-11-25 15:27:03,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2022-11-25 15:27:03,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:27:03,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2022-11-25 15:27:03,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 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-25 15:27:03,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:27:03,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 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-25 15:27:03,860 INFO L175 Difference]: Start difference. First operand has 110 places, 114 transitions, 1609 flow. Second operand 5 states and 645 transitions. [2022-11-25 15:27:03,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 169 transitions, 2622 flow [2022-11-25 15:27:04,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 169 transitions, 2547 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-11-25 15:27:04,622 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 1449 flow [2022-11-25 15:27:04,623 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1449, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2022-11-25 15:27:04,623 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2022-11-25 15:27:04,623 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 1449 flow [2022-11-25 15:27:04,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 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-25 15:27:04,624 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:27:04,624 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] [2022-11-25 15:27:04,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:27:04,624 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:27:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -655273453, now seen corresponding path program 1 times [2022-11-25 15:27:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:04,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468066051] [2022-11-25 15:27:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:04,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:27:04,877 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-25 15:27:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:27:04,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468066051] [2022-11-25 15:27:04,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468066051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:27:04,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:27:04,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:27:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001035508] [2022-11-25 15:27:04,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:27:04,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:27:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:27:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:27:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:27:04,889 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 250 [2022-11-25 15:27:04,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 1449 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 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-25 15:27:04,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:27:04,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 250 [2022-11-25 15:27:04,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:27:06,463 INFO L130 PetriNetUnfolder]: 4601/7720 cut-off events. [2022-11-25 15:27:06,463 INFO L131 PetriNetUnfolder]: For 96292/97838 co-relation queries the response was YES. [2022-11-25 15:27:06,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49235 conditions, 7720 events. 4601/7720 cut-off events. For 96292/97838 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 56189 event pairs, 455 based on Foata normal form. 940/8506 useless extension candidates. Maximal degree in co-relation 49185. Up to 2696 conditions per place. [2022-11-25 15:27:06,504 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 57 selfloop transitions, 18 changer transitions 120/202 dead transitions. [2022-11-25 15:27:06,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 3333 flow [2022-11-25 15:27:06,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:27:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:27:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2022-11-25 15:27:06,506 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5022857142857143 [2022-11-25 15:27:06,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2022-11-25 15:27:06,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2022-11-25 15:27:06,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:27:06,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2022-11-25 15:27:06,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 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-25 15:27:06,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:27:06,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 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-25 15:27:06,511 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 1449 flow. Second operand 7 states and 879 transitions. [2022-11-25 15:27:06,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 3333 flow [2022-11-25 15:27:06,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 202 transitions, 3085 flow, removed 39 selfloop flow, removed 13 redundant places. [2022-11-25 15:27:06,795 INFO L231 Difference]: Finished difference. Result has 106 places, 51 transitions, 600 flow [2022-11-25 15:27:06,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=600, PETRI_PLACES=106, PETRI_TRANSITIONS=51} [2022-11-25 15:27:06,795 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 64 predicate places. [2022-11-25 15:27:06,796 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 51 transitions, 600 flow [2022-11-25 15:27:06,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 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-25 15:27:06,796 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:27:06,796 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] [2022-11-25 15:27:06,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 15:27:06,796 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 15:27:06,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:27:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1208246583, now seen corresponding path program 1 times [2022-11-25 15:27:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:27:06,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829545557] [2022-11-25 15:27:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:27:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:27:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:27:06,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:27:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:27:06,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:27:06,916 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:27:06,918 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 15:27:06,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 15:27:06,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 15:27:06,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 15:27:06,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 15:27:06,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 15:27:06,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 15:27:06,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 15:27:06,930 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:27:06,937 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:27:06,937 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:27:07,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:27:07 BasicIcfg [2022-11-25 15:27:07,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:27:07,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:27:07,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:27:07,050 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:27:07,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:25:50" (3/4) ... [2022-11-25 15:27:07,052 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:27:07,162 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:27:07,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:27:07,163 INFO L158 Benchmark]: Toolchain (without parser) took 78573.38ms. Allocated memory was 148.9MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 108.1MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-25 15:27:07,163 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 119.5MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:27:07,164 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.95ms. Allocated memory is still 148.9MB. Free memory was 108.1MB in the beginning and 98.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 15:27:07,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.10ms. Allocated memory is still 148.9MB. Free memory was 98.6MB in the beginning and 95.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:27:07,164 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 148.9MB. Free memory was 95.9MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:27:07,164 INFO L158 Benchmark]: RCFGBuilder took 1018.35ms. Allocated memory is still 148.9MB. Free memory was 93.7MB in the beginning and 60.3MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-25 15:27:07,165 INFO L158 Benchmark]: TraceAbstraction took 76634.11ms. Allocated memory was 148.9MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 60.0MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-25 15:27:07,165 INFO L158 Benchmark]: Witness Printer took 112.82ms. Allocated memory is still 10.9GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 15:27:07,167 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.24ms. Allocated memory is still 119.5MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.95ms. Allocated memory is still 148.9MB. Free memory was 108.1MB in the beginning and 98.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.10ms. Allocated memory is still 148.9MB. Free memory was 98.6MB in the beginning and 95.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 148.9MB. Free memory was 95.9MB in the beginning and 93.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.35ms. Allocated memory is still 148.9MB. Free memory was 93.7MB in the beginning and 60.3MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 76634.11ms. Allocated memory was 148.9MB in the beginning and 10.9GB in the end (delta: 10.8GB). Free memory was 60.0MB in the beginning and 9.2GB in the end (delta: -9.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 112.82ms. Allocated memory is still 10.9GB. Free memory was 9.2GB in the beginning and 9.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 143 PlacesBefore, 42 PlacesAfterwards, 132 TransitionsBefore, 30 TransitionsAfterwards, 3168 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 114 TotalNumberOfCompositions, 7741 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3867, independent: 3662, independent conditional: 0, independent unconditional: 3662, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2237, independent: 2186, independent conditional: 0, independent unconditional: 2186, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2237, independent: 2154, independent conditional: 0, independent unconditional: 2154, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 344, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3867, independent: 1476, independent conditional: 0, independent unconditional: 1476, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 2237, unknown conditional: 0, unknown unconditional: 2237] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1253; [L845] FCALL, FORK 0 pthread_create(&t1253, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1253, ((void *)0), P0, ((void *)0))=-3, t1253={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1254; [L847] FCALL, FORK 0 pthread_create(&t1254, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1254, ((void *)0), P1, ((void *)0))=-2, t1253={5:0}, t1254={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1255; [L849] FCALL, FORK 0 pthread_create(&t1255, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1255, ((void *)0), P2, ((void *)0))=-1, t1253={5:0}, t1254={6:0}, t1255={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1256; [L851] FCALL, FORK 0 pthread_create(&t1256, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1256, ((void *)0), P3, ((void *)0))=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L804] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L804] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1253={5:0}, t1254={6:0}, t1255={7:0}, t1256={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 845]: 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: 847]: 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: 849]: 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: 851]: 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 9 procedures, 172 locations, 7 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: 76.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 59.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1668 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1396 mSDsluCounter, 1271 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1016 mSDsCounter, 316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3676 IncrementalHoareTripleChecker+Invalid, 3992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 316 mSolverCounterUnsat, 255 mSDtfsCounter, 3676 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2583occurred in iteration=14, InterpolantAutomatonStates: 127, 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.9s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 2862 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-25 15:27:07,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_103c9522-73ae-4164-b2ea-16acfed2ed3f/bin/uautomizer-ZsLfNo2U6R/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