./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8 --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 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- 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-2329fc7 [2022-12-13 14:28:55,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:28:55,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:28:55,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:28:55,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:28:55,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:28:55,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:28:55,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:28:55,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:28:55,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:28:55,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:28:55,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:28:55,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:28:55,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:28:55,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:28:55,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:28:55,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:28:55,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:28:55,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:28:55,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:28:55,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:28:55,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:28:55,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:28:55,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:28:55,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:28:55,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:28:55,545 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:28:55,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:28:55,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:28:55,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:28:55,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:28:55,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:28:55,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:28:55,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:28:55,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:28:55,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:28:55,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:28:55,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:28:55,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:28:55,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:28:55,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:28:55,551 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 14:28:55,565 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:28:55,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:28:55,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:28:55,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:28:55,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:28:55,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:28:55,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:28:55,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:28:55,566 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:28:55,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:28:55,567 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:28:55,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 14:28:55,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:28:55,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:28:55,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:28:55,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:28:55,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:28:55,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:28:55,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 14:28:55,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:28:55,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:28:55,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:28:55,569 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 14:28:55,569 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:28:55,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:28:55,570 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:28:55,570 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_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/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_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2022-12-13 14:28:55,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:28:55,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:28:55,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:28:55,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:28:55,793 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:28:55,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 14:28:58,328 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:28:58,544 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:28:58,544 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 14:28:58,556 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/data/df0dcbfb6/a2ea5d24c71146aeb77ab17e4f90760d/FLAG9a9410fb4 [2022-12-13 14:28:58,886 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/data/df0dcbfb6/a2ea5d24c71146aeb77ab17e4f90760d [2022-12-13 14:28:58,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:28:58,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:28:58,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:28:58,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:28:58,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:28:58,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:28:58" (1/1) ... [2022-12-13 14:28:58,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345882b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:58, skipping insertion in model container [2022-12-13 14:28:58,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:28:58" (1/1) ... [2022-12-13 14:28:58,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:28:58,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:28:59,067 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_131c4ebf-fa1b-4d14-9e25-88cffe174f38/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 14:28:59,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:28:59,231 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:28:59,239 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_131c4ebf-fa1b-4d14-9e25-88cffe174f38/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 14:28:59,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:28:59,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:28:59,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:28:59,294 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:28:59,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59 WrapperNode [2022-12-13 14:28:59,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:28:59,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:28:59,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:28:59,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:28:59,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,327 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 14:28:59,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:28:59,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:28:59,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:28:59,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:28:59,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,345 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:28:59,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:28:59,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:28:59,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:28:59,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (1/1) ... [2022-12-13 14:28:59,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:28:59,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:28:59,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:28:59,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:28:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:28:59,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 14:28:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:28:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:28:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:28:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 14:28:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 14:28:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 14:28:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 14:28:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 14:28:59,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 14:28:59,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:28:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 14:28:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:28:59,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:28:59,411 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 14:28:59,518 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:28:59,520 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:28:59,831 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:28:59,974 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:28:59,975 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:28:59,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:28:59 BoogieIcfgContainer [2022-12-13 14:28:59,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:28:59,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:28:59,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:28:59,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:28:59,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:28:58" (1/3) ... [2022-12-13 14:28:59,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eacbe09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:28:59, skipping insertion in model container [2022-12-13 14:28:59,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:28:59" (2/3) ... [2022-12-13 14:28:59,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eacbe09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:28:59, skipping insertion in model container [2022-12-13 14:28:59,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:28:59" (3/3) ... [2022-12-13 14:28:59,986 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 14:28:59,995 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 14:29:00,005 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:29:00,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 14:29:00,006 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 14:29:00,053 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 14:29:00,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 14:29:00,123 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 14:29:00,123 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:29:00,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 14:29:00,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 14:29:00,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-13 14:29:00,135 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 14:29:00,146 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 14:29:00,149 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 14:29:00,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-13 14:29:00,176 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 14:29:00,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:29:00,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 14:29:00,178 INFO L119 LiptonReduction]: Number of co-enabled transitions 2052 [2022-12-13 14:29:02,948 INFO L134 LiptonReduction]: Checked pairs total: 5491 [2022-12-13 14:29:02,948 INFO L136 LiptonReduction]: Total number of compositions: 97 [2022-12-13 14:29:02,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:29:02,962 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;@8ccdb51, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:29:02,963 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 14:29:02,966 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-13 14:29:02,966 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:29:02,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:02,967 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:02,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash 810711258, now seen corresponding path program 1 times [2022-12-13 14:29:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:02,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640616774] [2022-12-13 14:29:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:03,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:03,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640616774] [2022-12-13 14:29:03,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640616774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:03,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:03,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:29:03,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368234771] [2022-12-13 14:29:03,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:03,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:29:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:29:03,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:29:03,283 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 211 [2022-12-13 14:29:03,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:03,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:03,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 211 [2022-12-13 14:29:03,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:03,633 INFO L130 PetriNetUnfolder]: 1555/2452 cut-off events. [2022-12-13 14:29:03,633 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 14:29:03,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 2452 events. 1555/2452 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12131 event pairs, 325 based on Foata normal form. 96/2356 useless extension candidates. Maximal degree in co-relation 4788. Up to 1735 conditions per place. [2022-12-13 14:29:03,644 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 31 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2022-12-13 14:29:03,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 159 flow [2022-12-13 14:29:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:29:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:29:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-12-13 14:29:03,654 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5276461295418642 [2022-12-13 14:29:03,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-12-13 14:29:03,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-12-13 14:29:03,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:03,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-12-13 14:29:03,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:03,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:03,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:03,664 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 334 transitions. [2022-12-13 14:29:03,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 159 flow [2022-12-13 14:29:03,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:29:03,668 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-12-13 14:29:03,669 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-13 14:29:03,672 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-13 14:29:03,672 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2022-12-13 14:29:03,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:03,672 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:03,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:03,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:29:03,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1299647622, now seen corresponding path program 1 times [2022-12-13 14:29:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:03,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025838432] [2022-12-13 14:29:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:04,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025838432] [2022-12-13 14:29:04,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025838432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:04,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:29:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979467163] [2022-12-13 14:29:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:04,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:29:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:29:04,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:29:04,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 211 [2022-12-13 14:29:04,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:04,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:04,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 211 [2022-12-13 14:29:04,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:04,682 INFO L130 PetriNetUnfolder]: 1783/2662 cut-off events. [2022-12-13 14:29:04,682 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2022-12-13 14:29:04,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 2662 events. 1783/2662 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 12241 event pairs, 365 based on Foata normal form. 142/2804 useless extension candidates. Maximal degree in co-relation 5508. Up to 1971 conditions per place. [2022-12-13 14:29:04,694 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 37 selfloop transitions, 11 changer transitions 31/79 dead transitions. [2022-12-13 14:29:04,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 79 transitions, 336 flow [2022-12-13 14:29:04,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:29:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:29:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2022-12-13 14:29:04,699 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47731888964116453 [2022-12-13 14:29:04,700 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2022-12-13 14:29:04,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2022-12-13 14:29:04,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:04,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2022-12-13 14:29:04,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:04,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:04,708 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:04,708 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 7 states and 705 transitions. [2022-12-13 14:29:04,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 79 transitions, 336 flow [2022-12-13 14:29:04,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 79 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:29:04,710 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 136 flow [2022-12-13 14:29:04,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-13 14:29:04,711 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-13 14:29:04,711 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 136 flow [2022-12-13 14:29:04,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:04,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:04,712 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:04,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:29:04,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:04,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1634370785, now seen corresponding path program 1 times [2022-12-13 14:29:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:04,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246317945] [2022-12-13 14:29:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:04,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:04,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246317945] [2022-12-13 14:29:04,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246317945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:04,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:04,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:29:04,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645671460] [2022-12-13 14:29:04,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:04,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:29:04,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:04,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:29:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:29:04,857 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-12-13 14:29:04,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:04,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:04,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-12-13 14:29:04,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:05,227 INFO L130 PetriNetUnfolder]: 1364/2077 cut-off events. [2022-12-13 14:29:05,227 INFO L131 PetriNetUnfolder]: For 1781/1806 co-relation queries the response was YES. [2022-12-13 14:29:05,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6524 conditions, 2077 events. 1364/2077 cut-off events. For 1781/1806 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9290 event pairs, 391 based on Foata normal form. 133/2210 useless extension candidates. Maximal degree in co-relation 6509. Up to 1054 conditions per place. [2022-12-13 14:29:05,235 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 41 selfloop transitions, 3 changer transitions 25/71 dead transitions. [2022-12-13 14:29:05,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 71 transitions, 440 flow [2022-12-13 14:29:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:29:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:29:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-12-13 14:29:05,238 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5080568720379147 [2022-12-13 14:29:05,238 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2022-12-13 14:29:05,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2022-12-13 14:29:05,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:05,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2022-12-13 14:29:05,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:05,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:05,243 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:05,243 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 136 flow. Second operand 5 states and 536 transitions. [2022-12-13 14:29:05,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 71 transitions, 440 flow [2022-12-13 14:29:05,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 71 transitions, 436 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 14:29:05,249 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 147 flow [2022-12-13 14:29:05,249 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-12-13 14:29:05,250 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2022-12-13 14:29:05,250 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 147 flow [2022-12-13 14:29:05,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:05,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:05,250 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:05,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:29:05,251 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1480861176, now seen corresponding path program 1 times [2022-12-13 14:29:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:05,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23362675] [2022-12-13 14:29:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:06,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23362675] [2022-12-13 14:29:06,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23362675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:06,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:06,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:29:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367745086] [2022-12-13 14:29:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:06,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:29:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:06,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:29:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:29:06,069 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 14:29:06,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 147 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:06,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:06,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 14:29:06,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:06,501 INFO L130 PetriNetUnfolder]: 1173/1810 cut-off events. [2022-12-13 14:29:06,501 INFO L131 PetriNetUnfolder]: For 1838/1847 co-relation queries the response was YES. [2022-12-13 14:29:06,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5853 conditions, 1810 events. 1173/1810 cut-off events. For 1838/1847 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7864 event pairs, 74 based on Foata normal form. 53/1863 useless extension candidates. Maximal degree in co-relation 5835. Up to 1311 conditions per place. [2022-12-13 14:29:06,509 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 43 selfloop transitions, 4 changer transitions 15/64 dead transitions. [2022-12-13 14:29:06,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 407 flow [2022-12-13 14:29:06,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:29:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:29:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 617 transitions. [2022-12-13 14:29:06,510 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4873617693522907 [2022-12-13 14:29:06,510 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 617 transitions. [2022-12-13 14:29:06,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 617 transitions. [2022-12-13 14:29:06,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:06,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 617 transitions. [2022-12-13 14:29:06,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:06,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:06,514 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:06,514 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 147 flow. Second operand 6 states and 617 transitions. [2022-12-13 14:29:06,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 407 flow [2022-12-13 14:29:06,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 395 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 14:29:06,518 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 162 flow [2022-12-13 14:29:06,519 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-13 14:29:06,519 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2022-12-13 14:29:06,519 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 162 flow [2022-12-13 14:29:06,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:06,520 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:06,520 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:06,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:29:06,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -231394191, now seen corresponding path program 1 times [2022-12-13 14:29:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:06,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785425889] [2022-12-13 14:29:06,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:07,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785425889] [2022-12-13 14:29:07,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785425889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:07,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:07,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:29:07,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969922334] [2022-12-13 14:29:07,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:07,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:29:07,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:07,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:29:07,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:29:07,308 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2022-12-13 14:29:07,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 162 flow. Second operand has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:07,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:07,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2022-12-13 14:29:07,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:07,976 INFO L130 PetriNetUnfolder]: 1554/2392 cut-off events. [2022-12-13 14:29:07,976 INFO L131 PetriNetUnfolder]: For 2222/2243 co-relation queries the response was YES. [2022-12-13 14:29:07,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8051 conditions, 2392 events. 1554/2392 cut-off events. For 2222/2243 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11218 event pairs, 53 based on Foata normal form. 57/2449 useless extension candidates. Maximal degree in co-relation 8031. Up to 1486 conditions per place. [2022-12-13 14:29:07,984 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 68 selfloop transitions, 31 changer transitions 10/111 dead transitions. [2022-12-13 14:29:07,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 111 transitions, 725 flow [2022-12-13 14:29:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:29:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 14:29:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 883 transitions. [2022-12-13 14:29:07,986 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4649815692469721 [2022-12-13 14:29:07,987 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 883 transitions. [2022-12-13 14:29:07,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 883 transitions. [2022-12-13 14:29:07,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:07,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 883 transitions. [2022-12-13 14:29:07,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.11111111111111) internal successors, (883), 9 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:07,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:07,991 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:07,991 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 162 flow. Second operand 9 states and 883 transitions. [2022-12-13 14:29:07,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 111 transitions, 725 flow [2022-12-13 14:29:07,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 111 transitions, 714 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 14:29:07,995 INFO L231 Difference]: Finished difference. Result has 50 places, 63 transitions, 426 flow [2022-12-13 14:29:07,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=426, PETRI_PLACES=50, PETRI_TRANSITIONS=63} [2022-12-13 14:29:07,996 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2022-12-13 14:29:07,996 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 63 transitions, 426 flow [2022-12-13 14:29:07,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:07,996 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:07,997 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:07,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:29:07,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1425629847, now seen corresponding path program 2 times [2022-12-13 14:29:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:07,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576051089] [2022-12-13 14:29:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:07,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:08,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:08,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576051089] [2022-12-13 14:29:08,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576051089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:08,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:08,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:29:08,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571189379] [2022-12-13 14:29:08,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:08,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:29:08,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:29:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:29:08,752 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 211 [2022-12-13 14:29:08,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 63 transitions, 426 flow. Second operand has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:08,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:08,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 211 [2022-12-13 14:29:08,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:09,410 INFO L130 PetriNetUnfolder]: 1927/2964 cut-off events. [2022-12-13 14:29:09,410 INFO L131 PetriNetUnfolder]: For 4777/4819 co-relation queries the response was YES. [2022-12-13 14:29:09,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11827 conditions, 2964 events. 1927/2964 cut-off events. For 4777/4819 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14705 event pairs, 111 based on Foata normal form. 112/3076 useless extension candidates. Maximal degree in co-relation 11806. Up to 1587 conditions per place. [2022-12-13 14:29:09,424 INFO L137 encePairwiseOnDemand]: 201/211 looper letters, 72 selfloop transitions, 44 changer transitions 29/147 dead transitions. [2022-12-13 14:29:09,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 147 transitions, 1226 flow [2022-12-13 14:29:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:29:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 14:29:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 900 transitions. [2022-12-13 14:29:09,427 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47393364928909953 [2022-12-13 14:29:09,427 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 900 transitions. [2022-12-13 14:29:09,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 900 transitions. [2022-12-13 14:29:09,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:09,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 900 transitions. [2022-12-13 14:29:09,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.0) internal successors, (900), 9 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:09,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:09,432 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:09,432 INFO L175 Difference]: Start difference. First operand has 50 places, 63 transitions, 426 flow. Second operand 9 states and 900 transitions. [2022-12-13 14:29:09,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 147 transitions, 1226 flow [2022-12-13 14:29:09,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 147 transitions, 1202 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 14:29:09,441 INFO L231 Difference]: Finished difference. Result has 61 places, 88 transitions, 768 flow [2022-12-13 14:29:09,441 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=768, PETRI_PLACES=61, PETRI_TRANSITIONS=88} [2022-12-13 14:29:09,441 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2022-12-13 14:29:09,442 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 88 transitions, 768 flow [2022-12-13 14:29:09,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.66666666666667) internal successors, (834), 9 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:09,442 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:09,442 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:09,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:29:09,442 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:09,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash 432434823, now seen corresponding path program 3 times [2022-12-13 14:29:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:09,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937728795] [2022-12-13 14:29:09,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:09,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:10,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:10,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937728795] [2022-12-13 14:29:10,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937728795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:10,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:10,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:29:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060818564] [2022-12-13 14:29:10,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:10,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:29:10,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:10,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:29:10,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:29:10,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 14:29:10,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 88 transitions, 768 flow. Second operand has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:10,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:10,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 14:29:10,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:10,762 INFO L130 PetriNetUnfolder]: 2165/3319 cut-off events. [2022-12-13 14:29:10,762 INFO L131 PetriNetUnfolder]: For 11473/11561 co-relation queries the response was YES. [2022-12-13 14:29:10,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15922 conditions, 3319 events. 2165/3319 cut-off events. For 11473/11561 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16801 event pairs, 115 based on Foata normal form. 109/3425 useless extension candidates. Maximal degree in co-relation 15895. Up to 2029 conditions per place. [2022-12-13 14:29:10,784 INFO L137 encePairwiseOnDemand]: 203/211 looper letters, 115 selfloop transitions, 45 changer transitions 19/181 dead transitions. [2022-12-13 14:29:10,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 181 transitions, 1819 flow [2022-12-13 14:29:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:29:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 14:29:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 927 transitions. [2022-12-13 14:29:10,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4881516587677725 [2022-12-13 14:29:10,787 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 927 transitions. [2022-12-13 14:29:10,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 927 transitions. [2022-12-13 14:29:10,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:10,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 927 transitions. [2022-12-13 14:29:10,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.0) internal successors, (927), 9 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:10,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:10,790 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:10,790 INFO L175 Difference]: Start difference. First operand has 61 places, 88 transitions, 768 flow. Second operand 9 states and 927 transitions. [2022-12-13 14:29:10,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 181 transitions, 1819 flow [2022-12-13 14:29:10,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 181 transitions, 1747 flow, removed 29 selfloop flow, removed 5 redundant places. [2022-12-13 14:29:10,805 INFO L231 Difference]: Finished difference. Result has 66 places, 116 transitions, 1182 flow [2022-12-13 14:29:10,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1182, PETRI_PLACES=66, PETRI_TRANSITIONS=116} [2022-12-13 14:29:10,805 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2022-12-13 14:29:10,805 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 116 transitions, 1182 flow [2022-12-13 14:29:10,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:10,806 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:10,806 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:10,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:29:10,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:10,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2082550445, now seen corresponding path program 4 times [2022-12-13 14:29:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:10,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122527631] [2022-12-13 14:29:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:11,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:11,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122527631] [2022-12-13 14:29:11,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122527631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:11,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:11,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:29:11,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736892700] [2022-12-13 14:29:11,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:11,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:29:11,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:29:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:29:11,165 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-12-13 14:29:11,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 116 transitions, 1182 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:11,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:11,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-12-13 14:29:11,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:11,842 INFO L130 PetriNetUnfolder]: 2299/3518 cut-off events. [2022-12-13 14:29:11,842 INFO L131 PetriNetUnfolder]: For 15323/15417 co-relation queries the response was YES. [2022-12-13 14:29:11,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17988 conditions, 3518 events. 2299/3518 cut-off events. For 15323/15417 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18037 event pairs, 179 based on Foata normal form. 115/3630 useless extension candidates. Maximal degree in co-relation 17958. Up to 2079 conditions per place. [2022-12-13 14:29:11,855 INFO L137 encePairwiseOnDemand]: 201/211 looper letters, 84 selfloop transitions, 76 changer transitions 20/182 dead transitions. [2022-12-13 14:29:11,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 182 transitions, 2107 flow [2022-12-13 14:29:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:29:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:29:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 810 transitions. [2022-12-13 14:29:11,857 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47985781990521326 [2022-12-13 14:29:11,857 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 810 transitions. [2022-12-13 14:29:11,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 810 transitions. [2022-12-13 14:29:11,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:11,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 810 transitions. [2022-12-13 14:29:11,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.25) internal successors, (810), 8 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:11,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:11,862 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:11,862 INFO L175 Difference]: Start difference. First operand has 66 places, 116 transitions, 1182 flow. Second operand 8 states and 810 transitions. [2022-12-13 14:29:11,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 182 transitions, 2107 flow [2022-12-13 14:29:11,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 182 transitions, 2083 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 14:29:11,887 INFO L231 Difference]: Finished difference. Result has 71 places, 138 transitions, 1702 flow [2022-12-13 14:29:11,887 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1160, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1702, PETRI_PLACES=71, PETRI_TRANSITIONS=138} [2022-12-13 14:29:11,888 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2022-12-13 14:29:11,888 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 138 transitions, 1702 flow [2022-12-13 14:29:11,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:11,889 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:11,889 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:11,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:29:11,889 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:11,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash 846246005, now seen corresponding path program 1 times [2022-12-13 14:29:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:11,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029630757] [2022-12-13 14:29:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:12,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:12,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029630757] [2022-12-13 14:29:12,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029630757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:12,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:12,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:29:12,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205383645] [2022-12-13 14:29:12,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:12,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:29:12,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:12,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:29:12,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:29:12,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 211 [2022-12-13 14:29:12,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 138 transitions, 1702 flow. Second operand has 10 states, 10 states have (on average 92.6) internal successors, (926), 10 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:12,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:12,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 211 [2022-12-13 14:29:12,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:13,665 INFO L130 PetriNetUnfolder]: 2340/3583 cut-off events. [2022-12-13 14:29:13,665 INFO L131 PetriNetUnfolder]: For 22945/23051 co-relation queries the response was YES. [2022-12-13 14:29:13,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20593 conditions, 3583 events. 2340/3583 cut-off events. For 22945/23051 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 18603 event pairs, 151 based on Foata normal form. 108/3688 useless extension candidates. Maximal degree in co-relation 20560. Up to 1934 conditions per place. [2022-12-13 14:29:13,681 INFO L137 encePairwiseOnDemand]: 203/211 looper letters, 96 selfloop transitions, 77 changer transitions 15/190 dead transitions. [2022-12-13 14:29:13,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 190 transitions, 2518 flow [2022-12-13 14:29:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:29:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:29:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 800 transitions. [2022-12-13 14:29:13,683 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47393364928909953 [2022-12-13 14:29:13,683 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 800 transitions. [2022-12-13 14:29:13,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 800 transitions. [2022-12-13 14:29:13,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:13,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 800 transitions. [2022-12-13 14:29:13,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:13,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:13,685 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:13,686 INFO L175 Difference]: Start difference. First operand has 71 places, 138 transitions, 1702 flow. Second operand 8 states and 800 transitions. [2022-12-13 14:29:13,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 190 transitions, 2518 flow [2022-12-13 14:29:13,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 190 transitions, 2464 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 14:29:13,737 INFO L231 Difference]: Finished difference. Result has 76 places, 144 transitions, 2006 flow [2022-12-13 14:29:13,737 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2006, PETRI_PLACES=76, PETRI_TRANSITIONS=144} [2022-12-13 14:29:13,737 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2022-12-13 14:29:13,737 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 144 transitions, 2006 flow [2022-12-13 14:29:13,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.6) internal successors, (926), 10 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:13,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:13,738 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:13,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:29:13,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:13,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:13,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1244916517, now seen corresponding path program 1 times [2022-12-13 14:29:13,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:13,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924616752] [2022-12-13 14:29:13,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:14,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924616752] [2022-12-13 14:29:14,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924616752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:14,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:14,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:29:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672730993] [2022-12-13 14:29:14,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:14,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:29:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:29:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:29:14,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2022-12-13 14:29:14,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 144 transitions, 2006 flow. Second operand has 10 states, 10 states have (on average 89.6) internal successors, (896), 10 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-12-13 14:29:14,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:14,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2022-12-13 14:29:14,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:15,927 INFO L130 PetriNetUnfolder]: 2772/4310 cut-off events. [2022-12-13 14:29:15,927 INFO L131 PetriNetUnfolder]: For 37460/37588 co-relation queries the response was YES. [2022-12-13 14:29:15,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26743 conditions, 4310 events. 2772/4310 cut-off events. For 37460/37588 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 23752 event pairs, 139 based on Foata normal form. 160/4470 useless extension candidates. Maximal degree in co-relation 26708. Up to 2560 conditions per place. [2022-12-13 14:29:15,947 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 107 selfloop transitions, 159 changer transitions 14/282 dead transitions. [2022-12-13 14:29:15,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 282 transitions, 4135 flow [2022-12-13 14:29:15,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:29:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 14:29:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1069 transitions. [2022-12-13 14:29:15,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46057733735458856 [2022-12-13 14:29:15,949 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1069 transitions. [2022-12-13 14:29:15,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1069 transitions. [2022-12-13 14:29:15,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:15,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1069 transitions. [2022-12-13 14:29:15,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 97.18181818181819) internal successors, (1069), 11 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:15,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:15,953 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:15,953 INFO L175 Difference]: Start difference. First operand has 76 places, 144 transitions, 2006 flow. Second operand 11 states and 1069 transitions. [2022-12-13 14:29:15,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 282 transitions, 4135 flow [2022-12-13 14:29:16,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 282 transitions, 3893 flow, removed 64 selfloop flow, removed 7 redundant places. [2022-12-13 14:29:16,031 INFO L231 Difference]: Finished difference. Result has 83 places, 229 transitions, 3510 flow [2022-12-13 14:29:16,032 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1874, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3510, PETRI_PLACES=83, PETRI_TRANSITIONS=229} [2022-12-13 14:29:16,032 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 48 predicate places. [2022-12-13 14:29:16,032 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 229 transitions, 3510 flow [2022-12-13 14:29:16,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.6) internal successors, (896), 10 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-12-13 14:29:16,033 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:16,033 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:16,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:29:16,033 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1247165257, now seen corresponding path program 2 times [2022-12-13 14:29:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:16,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459215256] [2022-12-13 14:29:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:16,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459215256] [2022-12-13 14:29:16,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459215256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:16,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:16,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:29:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481655363] [2022-12-13 14:29:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:16,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:29:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:29:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:29:16,507 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2022-12-13 14:29:16,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 229 transitions, 3510 flow. Second operand has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:16,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:16,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2022-12-13 14:29:16,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:17,400 INFO L130 PetriNetUnfolder]: 2970/4635 cut-off events. [2022-12-13 14:29:17,400 INFO L131 PetriNetUnfolder]: For 40429/40550 co-relation queries the response was YES. [2022-12-13 14:29:17,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29517 conditions, 4635 events. 2970/4635 cut-off events. For 40429/40550 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 26329 event pairs, 201 based on Foata normal form. 121/4754 useless extension candidates. Maximal degree in co-relation 29480. Up to 2726 conditions per place. [2022-12-13 14:29:17,420 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 256 selfloop transitions, 121 changer transitions 19/398 dead transitions. [2022-12-13 14:29:17,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 398 transitions, 6316 flow [2022-12-13 14:29:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:29:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 14:29:17,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1167 transitions. [2022-12-13 14:29:17,423 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4609004739336493 [2022-12-13 14:29:17,423 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1167 transitions. [2022-12-13 14:29:17,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1167 transitions. [2022-12-13 14:29:17,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:17,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1167 transitions. [2022-12-13 14:29:17,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 97.25) internal successors, (1167), 12 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:17,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:17,427 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:17,427 INFO L175 Difference]: Start difference. First operand has 83 places, 229 transitions, 3510 flow. Second operand 12 states and 1167 transitions. [2022-12-13 14:29:17,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 398 transitions, 6316 flow [2022-12-13 14:29:17,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 398 transitions, 6158 flow, removed 69 selfloop flow, removed 4 redundant places. [2022-12-13 14:29:17,507 INFO L231 Difference]: Finished difference. Result has 96 places, 291 transitions, 4706 flow [2022-12-13 14:29:17,507 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=3388, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4706, PETRI_PLACES=96, PETRI_TRANSITIONS=291} [2022-12-13 14:29:17,508 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2022-12-13 14:29:17,508 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 291 transitions, 4706 flow [2022-12-13 14:29:17,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:17,508 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:17,508 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:17,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:29:17,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:17,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:17,508 INFO L85 PathProgramCache]: Analyzing trace with hash 525995063, now seen corresponding path program 3 times [2022-12-13 14:29:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:17,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347402503] [2022-12-13 14:29:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:17,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:18,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:18,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347402503] [2022-12-13 14:29:18,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347402503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:18,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:18,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:29:18,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369650040] [2022-12-13 14:29:18,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:18,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:29:18,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:18,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:29:18,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:29:18,097 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 211 [2022-12-13 14:29:18,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 291 transitions, 4706 flow. Second operand has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:18,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:18,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 211 [2022-12-13 14:29:18,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:19,366 INFO L130 PetriNetUnfolder]: 3237/5104 cut-off events. [2022-12-13 14:29:19,366 INFO L131 PetriNetUnfolder]: For 49683/49876 co-relation queries the response was YES. [2022-12-13 14:29:19,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33769 conditions, 5104 events. 3237/5104 cut-off events. For 49683/49876 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30263 event pairs, 232 based on Foata normal form. 155/5256 useless extension candidates. Maximal degree in co-relation 33726. Up to 2759 conditions per place. [2022-12-13 14:29:19,389 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 220 selfloop transitions, 177 changer transitions 42/441 dead transitions. [2022-12-13 14:29:19,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 441 transitions, 7336 flow [2022-12-13 14:29:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 14:29:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 14:29:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1366 transitions. [2022-12-13 14:29:19,391 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46242383209207855 [2022-12-13 14:29:19,391 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1366 transitions. [2022-12-13 14:29:19,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1366 transitions. [2022-12-13 14:29:19,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:19,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1366 transitions. [2022-12-13 14:29:19,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 97.57142857142857) internal successors, (1366), 14 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:19,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 211.0) internal successors, (3165), 15 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:19,396 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 211.0) internal successors, (3165), 15 states have internal predecessors, (3165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:19,396 INFO L175 Difference]: Start difference. First operand has 96 places, 291 transitions, 4706 flow. Second operand 14 states and 1366 transitions. [2022-12-13 14:29:19,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 441 transitions, 7336 flow [2022-12-13 14:29:19,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 441 transitions, 7245 flow, removed 43 selfloop flow, removed 2 redundant places. [2022-12-13 14:29:19,521 INFO L231 Difference]: Finished difference. Result has 114 places, 336 transitions, 6052 flow [2022-12-13 14:29:19,521 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=4639, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6052, PETRI_PLACES=114, PETRI_TRANSITIONS=336} [2022-12-13 14:29:19,522 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2022-12-13 14:29:19,522 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 336 transitions, 6052 flow [2022-12-13 14:29:19,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.6) internal successors, (906), 10 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:19,522 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:19,522 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:19,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 14:29:19,522 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:19,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash 528243803, now seen corresponding path program 4 times [2022-12-13 14:29:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:19,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727618105] [2022-12-13 14:29:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:19,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:20,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:20,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727618105] [2022-12-13 14:29:20,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727618105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:20,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:20,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:29:20,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298244262] [2022-12-13 14:29:20,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:20,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:29:20,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:20,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:29:20,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:29:20,083 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 211 [2022-12-13 14:29:20,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 336 transitions, 6052 flow. Second operand has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:20,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:20,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 211 [2022-12-13 14:29:20,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:21,452 INFO L130 PetriNetUnfolder]: 3133/4945 cut-off events. [2022-12-13 14:29:21,453 INFO L131 PetriNetUnfolder]: For 57639/57775 co-relation queries the response was YES. [2022-12-13 14:29:21,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34408 conditions, 4945 events. 3133/4945 cut-off events. For 57639/57775 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 29104 event pairs, 167 based on Foata normal form. 172/5117 useless extension candidates. Maximal degree in co-relation 34357. Up to 2601 conditions per place. [2022-12-13 14:29:21,478 INFO L137 encePairwiseOnDemand]: 201/211 looper letters, 191 selfloop transitions, 214 changer transitions 18/425 dead transitions. [2022-12-13 14:29:21,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 425 transitions, 7881 flow [2022-12-13 14:29:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:29:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 14:29:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1066 transitions. [2022-12-13 14:29:21,481 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4592847910383455 [2022-12-13 14:29:21,481 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1066 transitions. [2022-12-13 14:29:21,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1066 transitions. [2022-12-13 14:29:21,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:21,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1066 transitions. [2022-12-13 14:29:21,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.9090909090909) internal successors, (1066), 11 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:21,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:21,484 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:21,484 INFO L175 Difference]: Start difference. First operand has 114 places, 336 transitions, 6052 flow. Second operand 11 states and 1066 transitions. [2022-12-13 14:29:21,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 425 transitions, 7881 flow [2022-12-13 14:29:21,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 425 transitions, 7624 flow, removed 86 selfloop flow, removed 4 redundant places. [2022-12-13 14:29:21,676 INFO L231 Difference]: Finished difference. Result has 122 places, 371 transitions, 6965 flow [2022-12-13 14:29:21,676 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=5817, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6965, PETRI_PLACES=122, PETRI_TRANSITIONS=371} [2022-12-13 14:29:21,677 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2022-12-13 14:29:21,677 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 371 transitions, 6965 flow [2022-12-13 14:29:21,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.0) internal successors, (728), 8 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:21,677 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:21,677 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:21,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:29:21,677 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 460920001, now seen corresponding path program 1 times [2022-12-13 14:29:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:21,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526860170] [2022-12-13 14:29:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:21,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:21,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526860170] [2022-12-13 14:29:21,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526860170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:21,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:21,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:29:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419752008] [2022-12-13 14:29:21,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:21,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:29:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:29:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:29:21,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 211 [2022-12-13 14:29:21,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 371 transitions, 6965 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:21,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:21,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 211 [2022-12-13 14:29:21,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:23,188 INFO L130 PetriNetUnfolder]: 4268/6666 cut-off events. [2022-12-13 14:29:23,188 INFO L131 PetriNetUnfolder]: For 73159/73159 co-relation queries the response was YES. [2022-12-13 14:29:23,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45611 conditions, 6666 events. 4268/6666 cut-off events. For 73159/73159 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 39999 event pairs, 728 based on Foata normal form. 66/6732 useless extension candidates. Maximal degree in co-relation 45556. Up to 3399 conditions per place. [2022-12-13 14:29:23,241 INFO L137 encePairwiseOnDemand]: 203/211 looper letters, 260 selfloop transitions, 11 changer transitions 227/498 dead transitions. [2022-12-13 14:29:23,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 498 transitions, 10031 flow [2022-12-13 14:29:23,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:29:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:29:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2022-12-13 14:29:23,243 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46919431279620855 [2022-12-13 14:29:23,243 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2022-12-13 14:29:23,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2022-12-13 14:29:23,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:23,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2022-12-13 14:29:23,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:23,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:23,246 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:23,246 INFO L175 Difference]: Start difference. First operand has 122 places, 371 transitions, 6965 flow. Second operand 6 states and 594 transitions. [2022-12-13 14:29:23,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 498 transitions, 10031 flow [2022-12-13 14:29:23,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 498 transitions, 9781 flow, removed 109 selfloop flow, removed 5 redundant places. [2022-12-13 14:29:23,523 INFO L231 Difference]: Finished difference. Result has 123 places, 231 transitions, 4196 flow [2022-12-13 14:29:23,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=6807, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4196, PETRI_PLACES=123, PETRI_TRANSITIONS=231} [2022-12-13 14:29:23,524 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 88 predicate places. [2022-12-13 14:29:23,524 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 231 transitions, 4196 flow [2022-12-13 14:29:23,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:23,524 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:23,524 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:23,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:29:23,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash -998652109, now seen corresponding path program 1 times [2022-12-13 14:29:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:23,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276209418] [2022-12-13 14:29:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:24,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:24,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276209418] [2022-12-13 14:29:24,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276209418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:24,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:24,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:29:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653771509] [2022-12-13 14:29:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:29:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:24,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:29:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:29:24,164 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-12-13 14:29:24,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 231 transitions, 4196 flow. Second operand has 10 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:24,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:24,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-12-13 14:29:24,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:25,226 INFO L130 PetriNetUnfolder]: 2869/4679 cut-off events. [2022-12-13 14:29:25,226 INFO L131 PetriNetUnfolder]: For 55632/55736 co-relation queries the response was YES. [2022-12-13 14:29:25,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31467 conditions, 4679 events. 2869/4679 cut-off events. For 55632/55736 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 28454 event pairs, 622 based on Foata normal form. 108/4784 useless extension candidates. Maximal degree in co-relation 31410. Up to 3330 conditions per place. [2022-12-13 14:29:25,254 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 184 selfloop transitions, 49 changer transitions 45/280 dead transitions. [2022-12-13 14:29:25,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 280 transitions, 5297 flow [2022-12-13 14:29:25,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:29:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:29:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 816 transitions. [2022-12-13 14:29:25,256 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4834123222748815 [2022-12-13 14:29:25,256 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 816 transitions. [2022-12-13 14:29:25,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 816 transitions. [2022-12-13 14:29:25,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:25,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 816 transitions. [2022-12-13 14:29:25,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:25,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:25,260 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:25,260 INFO L175 Difference]: Start difference. First operand has 123 places, 231 transitions, 4196 flow. Second operand 8 states and 816 transitions. [2022-12-13 14:29:25,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 280 transitions, 5297 flow [2022-12-13 14:29:25,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 280 transitions, 5142 flow, removed 11 selfloop flow, removed 11 redundant places. [2022-12-13 14:29:25,412 INFO L231 Difference]: Finished difference. Result has 118 places, 219 transitions, 3932 flow [2022-12-13 14:29:25,412 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=4046, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3932, PETRI_PLACES=118, PETRI_TRANSITIONS=219} [2022-12-13 14:29:25,413 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2022-12-13 14:29:25,413 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 219 transitions, 3932 flow [2022-12-13 14:29:25,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:25,413 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:25,413 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:25,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 14:29:25,413 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:25,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash 256176515, now seen corresponding path program 2 times [2022-12-13 14:29:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:25,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421319393] [2022-12-13 14:29:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:26,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:26,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421319393] [2022-12-13 14:29:26,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421319393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:26,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:26,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:29:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370941999] [2022-12-13 14:29:26,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:26,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:29:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:26,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:29:26,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:29:26,244 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 211 [2022-12-13 14:29:26,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 219 transitions, 3932 flow. Second operand has 9 states, 9 states have (on average 92.88888888888889) internal successors, (836), 9 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-12-13 14:29:26,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:26,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 211 [2022-12-13 14:29:26,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:27,275 INFO L130 PetriNetUnfolder]: 2430/3955 cut-off events. [2022-12-13 14:29:27,276 INFO L131 PetriNetUnfolder]: For 46445/46518 co-relation queries the response was YES. [2022-12-13 14:29:27,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26605 conditions, 3955 events. 2430/3955 cut-off events. For 46445/46518 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 23000 event pairs, 411 based on Foata normal form. 101/4056 useless extension candidates. Maximal degree in co-relation 26553. Up to 3082 conditions per place. [2022-12-13 14:29:27,294 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 144 selfloop transitions, 137 changer transitions 14/297 dead transitions. [2022-12-13 14:29:27,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 297 transitions, 5350 flow [2022-12-13 14:29:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 14:29:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 14:29:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1281 transitions. [2022-12-13 14:29:27,296 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46700692672256655 [2022-12-13 14:29:27,296 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1281 transitions. [2022-12-13 14:29:27,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1281 transitions. [2022-12-13 14:29:27,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:27,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1281 transitions. [2022-12-13 14:29:27,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:27,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 211.0) internal successors, (2954), 14 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:27,300 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 211.0) internal successors, (2954), 14 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:27,300 INFO L175 Difference]: Start difference. First operand has 118 places, 219 transitions, 3932 flow. Second operand 13 states and 1281 transitions. [2022-12-13 14:29:27,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 297 transitions, 5350 flow [2022-12-13 14:29:27,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 297 transitions, 5261 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 14:29:27,463 INFO L231 Difference]: Finished difference. Result has 127 places, 248 transitions, 4896 flow [2022-12-13 14:29:27,463 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=3849, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4896, PETRI_PLACES=127, PETRI_TRANSITIONS=248} [2022-12-13 14:29:27,463 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2022-12-13 14:29:27,464 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 248 transitions, 4896 flow [2022-12-13 14:29:27,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.88888888888889) internal successors, (836), 9 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-12-13 14:29:27,464 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:27,464 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:27,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 14:29:27,464 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1421337085, now seen corresponding path program 3 times [2022-12-13 14:29:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:27,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436164750] [2022-12-13 14:29:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:27,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436164750] [2022-12-13 14:29:27,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436164750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:27,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:27,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:29:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346679914] [2022-12-13 14:29:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:27,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:29:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:29:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:29:27,746 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 211 [2022-12-13 14:29:27,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 248 transitions, 4896 flow. Second operand has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:27,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:27,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 211 [2022-12-13 14:29:27,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:28,743 INFO L130 PetriNetUnfolder]: 2827/4649 cut-off events. [2022-12-13 14:29:28,744 INFO L131 PetriNetUnfolder]: For 63237/63321 co-relation queries the response was YES. [2022-12-13 14:29:28,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32477 conditions, 4649 events. 2827/4649 cut-off events. For 63237/63321 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 28397 event pairs, 222 based on Foata normal form. 100/4749 useless extension candidates. Maximal degree in co-relation 32422. Up to 2635 conditions per place. [2022-12-13 14:29:28,768 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 201 selfloop transitions, 80 changer transitions 24/307 dead transitions. [2022-12-13 14:29:28,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 307 transitions, 6274 flow [2022-12-13 14:29:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:29:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:29:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 801 transitions. [2022-12-13 14:29:28,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4745260663507109 [2022-12-13 14:29:28,770 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 801 transitions. [2022-12-13 14:29:28,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 801 transitions. [2022-12-13 14:29:28,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:28,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 801 transitions. [2022-12-13 14:29:28,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.125) internal successors, (801), 8 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:28,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:28,772 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:28,772 INFO L175 Difference]: Start difference. First operand has 127 places, 248 transitions, 4896 flow. Second operand 8 states and 801 transitions. [2022-12-13 14:29:28,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 307 transitions, 6274 flow [2022-12-13 14:29:29,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 307 transitions, 6117 flow, removed 59 selfloop flow, removed 6 redundant places. [2022-12-13 14:29:29,015 INFO L231 Difference]: Finished difference. Result has 129 places, 257 transitions, 5193 flow [2022-12-13 14:29:29,015 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=4763, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5193, PETRI_PLACES=129, PETRI_TRANSITIONS=257} [2022-12-13 14:29:29,016 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 94 predicate places. [2022-12-13 14:29:29,016 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 257 transitions, 5193 flow [2022-12-13 14:29:29,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:29,016 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:29,016 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 14:29:29,016 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:29,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash -640705703, now seen corresponding path program 4 times [2022-12-13 14:29:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:29,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751571762] [2022-12-13 14:29:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:29,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:29,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751571762] [2022-12-13 14:29:29,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751571762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:29,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:29,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 14:29:29,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785506885] [2022-12-13 14:29:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:29,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 14:29:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 14:29:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:29:29,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 211 [2022-12-13 14:29:29,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 257 transitions, 5193 flow. Second operand has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:29,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:29,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 211 [2022-12-13 14:29:29,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:30,933 INFO L130 PetriNetUnfolder]: 2910/4876 cut-off events. [2022-12-13 14:29:30,933 INFO L131 PetriNetUnfolder]: For 69977/70077 co-relation queries the response was YES. [2022-12-13 14:29:30,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35064 conditions, 4876 events. 2910/4876 cut-off events. For 69977/70077 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 31007 event pairs, 613 based on Foata normal form. 128/5004 useless extension candidates. Maximal degree in co-relation 35007. Up to 3137 conditions per place. [2022-12-13 14:29:30,956 INFO L137 encePairwiseOnDemand]: 201/211 looper letters, 233 selfloop transitions, 74 changer transitions 39/348 dead transitions. [2022-12-13 14:29:30,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 348 transitions, 7002 flow [2022-12-13 14:29:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:29:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 14:29:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1136 transitions. [2022-12-13 14:29:30,958 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4486571879936809 [2022-12-13 14:29:30,958 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1136 transitions. [2022-12-13 14:29:30,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1136 transitions. [2022-12-13 14:29:30,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:30,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1136 transitions. [2022-12-13 14:29:30,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 94.66666666666667) internal successors, (1136), 12 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:30,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:30,961 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:30,961 INFO L175 Difference]: Start difference. First operand has 129 places, 257 transitions, 5193 flow. Second operand 12 states and 1136 transitions. [2022-12-13 14:29:30,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 348 transitions, 7002 flow [2022-12-13 14:29:31,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 348 transitions, 6844 flow, removed 67 selfloop flow, removed 4 redundant places. [2022-12-13 14:29:31,222 INFO L231 Difference]: Finished difference. Result has 139 places, 268 transitions, 5445 flow [2022-12-13 14:29:31,222 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=5063, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5445, PETRI_PLACES=139, PETRI_TRANSITIONS=268} [2022-12-13 14:29:31,223 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2022-12-13 14:29:31,223 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 268 transitions, 5445 flow [2022-12-13 14:29:31,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:31,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:31,223 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:31,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 14:29:31,223 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -142764319, now seen corresponding path program 5 times [2022-12-13 14:29:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926551829] [2022-12-13 14:29:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:31,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:31,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926551829] [2022-12-13 14:29:31,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926551829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:31,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:31,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:29:31,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979368507] [2022-12-13 14:29:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:31,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:29:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:29:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:29:31,522 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 14:29:31,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 268 transitions, 5445 flow. Second operand has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:31,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:31,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 14:29:31,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:32,383 INFO L130 PetriNetUnfolder]: 2551/4282 cut-off events. [2022-12-13 14:29:32,383 INFO L131 PetriNetUnfolder]: For 61053/61136 co-relation queries the response was YES. [2022-12-13 14:29:32,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30980 conditions, 4282 events. 2551/4282 cut-off events. For 61053/61136 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 26581 event pairs, 689 based on Foata normal form. 99/4381 useless extension candidates. Maximal degree in co-relation 30920. Up to 3721 conditions per place. [2022-12-13 14:29:32,407 INFO L137 encePairwiseOnDemand]: 202/211 looper letters, 240 selfloop transitions, 31 changer transitions 28/301 dead transitions. [2022-12-13 14:29:32,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 301 transitions, 6424 flow [2022-12-13 14:29:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:29:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:29:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 810 transitions. [2022-12-13 14:29:32,409 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47985781990521326 [2022-12-13 14:29:32,409 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 810 transitions. [2022-12-13 14:29:32,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 810 transitions. [2022-12-13 14:29:32,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:32,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 810 transitions. [2022-12-13 14:29:32,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.25) internal successors, (810), 8 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:32,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:32,430 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:32,430 INFO L175 Difference]: Start difference. First operand has 139 places, 268 transitions, 5445 flow. Second operand 8 states and 810 transitions. [2022-12-13 14:29:32,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 301 transitions, 6424 flow [2022-12-13 14:29:32,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 301 transitions, 6295 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-12-13 14:29:32,578 INFO L231 Difference]: Finished difference. Result has 140 places, 265 transitions, 5318 flow [2022-12-13 14:29:32,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=5318, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5318, PETRI_PLACES=140, PETRI_TRANSITIONS=265} [2022-12-13 14:29:32,579 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2022-12-13 14:29:32,579 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 265 transitions, 5318 flow [2022-12-13 14:29:32,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.125) internal successors, (769), 8 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:32,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:32,579 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:32,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 14:29:32,579 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:32,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:32,580 INFO L85 PathProgramCache]: Analyzing trace with hash 539982969, now seen corresponding path program 6 times [2022-12-13 14:29:32,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:32,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480945773] [2022-12-13 14:29:32,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:32,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:32,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480945773] [2022-12-13 14:29:32,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480945773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:32,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:32,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:29:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568750841] [2022-12-13 14:29:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:32,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:29:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:32,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:29:32,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:29:32,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-12-13 14:29:32,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 265 transitions, 5318 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:32,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:32,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-12-13 14:29:32,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:34,114 INFO L130 PetriNetUnfolder]: 3575/6039 cut-off events. [2022-12-13 14:29:34,114 INFO L131 PetriNetUnfolder]: For 80111/80217 co-relation queries the response was YES. [2022-12-13 14:29:34,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40970 conditions, 6039 events. 3575/6039 cut-off events. For 80111/80217 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 40452 event pairs, 646 based on Foata normal form. 134/6173 useless extension candidates. Maximal degree in co-relation 40909. Up to 2984 conditions per place. [2022-12-13 14:29:34,143 INFO L137 encePairwiseOnDemand]: 203/211 looper letters, 223 selfloop transitions, 51 changer transitions 75/351 dead transitions. [2022-12-13 14:29:34,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 351 transitions, 7404 flow [2022-12-13 14:29:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:29:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:29:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 811 transitions. [2022-12-13 14:29:34,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48045023696682465 [2022-12-13 14:29:34,145 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 811 transitions. [2022-12-13 14:29:34,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 811 transitions. [2022-12-13 14:29:34,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:34,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 811 transitions. [2022-12-13 14:29:34,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.375) internal successors, (811), 8 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:34,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:34,147 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:34,147 INFO L175 Difference]: Start difference. First operand has 140 places, 265 transitions, 5318 flow. Second operand 8 states and 811 transitions. [2022-12-13 14:29:34,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 351 transitions, 7404 flow [2022-12-13 14:29:34,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 351 transitions, 7343 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 14:29:34,419 INFO L231 Difference]: Finished difference. Result has 142 places, 256 transitions, 5239 flow [2022-12-13 14:29:34,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=5263, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5239, PETRI_PLACES=142, PETRI_TRANSITIONS=256} [2022-12-13 14:29:34,420 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2022-12-13 14:29:34,420 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 256 transitions, 5239 flow [2022-12-13 14:29:34,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:34,420 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:34,420 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:34,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 14:29:34,420 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:34,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash -50754951, now seen corresponding path program 7 times [2022-12-13 14:29:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:34,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563213302] [2022-12-13 14:29:34,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:34,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:34,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:34,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563213302] [2022-12-13 14:29:34,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563213302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:34,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:34,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:29:34,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601834619] [2022-12-13 14:29:34,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:34,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:29:34,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:34,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:29:34,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:29:34,935 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 211 [2022-12-13 14:29:34,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 256 transitions, 5239 flow. Second operand has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:34,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:34,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 211 [2022-12-13 14:29:34,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:36,189 INFO L130 PetriNetUnfolder]: 3351/5707 cut-off events. [2022-12-13 14:29:36,190 INFO L131 PetriNetUnfolder]: For 82128/82212 co-relation queries the response was YES. [2022-12-13 14:29:36,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39477 conditions, 5707 events. 3351/5707 cut-off events. For 82128/82212 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 38013 event pairs, 663 based on Foata normal form. 112/5819 useless extension candidates. Maximal degree in co-relation 39415. Up to 2576 conditions per place. [2022-12-13 14:29:36,217 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 253 selfloop transitions, 26 changer transitions 36/317 dead transitions. [2022-12-13 14:29:36,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 317 transitions, 6870 flow [2022-12-13 14:29:36,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:29:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:29:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 696 transitions. [2022-12-13 14:29:36,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4712254570074475 [2022-12-13 14:29:36,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 696 transitions. [2022-12-13 14:29:36,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 696 transitions. [2022-12-13 14:29:36,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:36,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 696 transitions. [2022-12-13 14:29:36,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.42857142857143) internal successors, (696), 7 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:36,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:36,221 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:36,221 INFO L175 Difference]: Start difference. First operand has 142 places, 256 transitions, 5239 flow. Second operand 7 states and 696 transitions. [2022-12-13 14:29:36,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 317 transitions, 6870 flow [2022-12-13 14:29:36,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 317 transitions, 6729 flow, removed 62 selfloop flow, removed 5 redundant places. [2022-12-13 14:29:36,598 INFO L231 Difference]: Finished difference. Result has 143 places, 250 transitions, 5093 flow [2022-12-13 14:29:36,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=5146, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5093, PETRI_PLACES=143, PETRI_TRANSITIONS=250} [2022-12-13 14:29:36,598 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 108 predicate places. [2022-12-13 14:29:36,599 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 250 transitions, 5093 flow [2022-12-13 14:29:36,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.125) internal successors, (745), 8 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:36,599 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:36,599 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:36,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 14:29:36,599 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:36,599 INFO L85 PathProgramCache]: Analyzing trace with hash 666047921, now seen corresponding path program 8 times [2022-12-13 14:29:36,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:36,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73452682] [2022-12-13 14:29:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:37,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:37,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73452682] [2022-12-13 14:29:37,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73452682] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:37,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:37,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 14:29:37,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721516007] [2022-12-13 14:29:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 14:29:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:37,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 14:29:37,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:29:37,515 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 211 [2022-12-13 14:29:37,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 250 transitions, 5093 flow. Second operand has 11 states, 11 states have (on average 91.54545454545455) internal successors, (1007), 11 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:37,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:37,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 211 [2022-12-13 14:29:37,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:39,231 INFO L130 PetriNetUnfolder]: 3339/5712 cut-off events. [2022-12-13 14:29:39,231 INFO L131 PetriNetUnfolder]: For 79631/79702 co-relation queries the response was YES. [2022-12-13 14:29:39,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37906 conditions, 5712 events. 3339/5712 cut-off events. For 79631/79702 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 38121 event pairs, 441 based on Foata normal form. 147/5859 useless extension candidates. Maximal degree in co-relation 37844. Up to 2463 conditions per place. [2022-12-13 14:29:39,257 INFO L137 encePairwiseOnDemand]: 203/211 looper letters, 151 selfloop transitions, 73 changer transitions 125/350 dead transitions. [2022-12-13 14:29:39,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 350 transitions, 6921 flow [2022-12-13 14:29:39,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 14:29:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 14:29:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1563 transitions. [2022-12-13 14:29:39,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4629739336492891 [2022-12-13 14:29:39,260 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1563 transitions. [2022-12-13 14:29:39,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1563 transitions. [2022-12-13 14:29:39,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:39,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1563 transitions. [2022-12-13 14:29:39,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 97.6875) internal successors, (1563), 16 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 211.0) internal successors, (3587), 17 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,263 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 211.0) internal successors, (3587), 17 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,263 INFO L175 Difference]: Start difference. First operand has 143 places, 250 transitions, 5093 flow. Second operand 16 states and 1563 transitions. [2022-12-13 14:29:39,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 350 transitions, 6921 flow [2022-12-13 14:29:39,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 350 transitions, 6818 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 14:29:39,525 INFO L231 Difference]: Finished difference. Result has 164 places, 188 transitions, 3794 flow [2022-12-13 14:29:39,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=5008, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3794, PETRI_PLACES=164, PETRI_TRANSITIONS=188} [2022-12-13 14:29:39,526 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 129 predicate places. [2022-12-13 14:29:39,526 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 188 transitions, 3794 flow [2022-12-13 14:29:39,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 91.54545454545455) internal successors, (1007), 11 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,526 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:39,526 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:39,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 14:29:39,526 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1450668870, now seen corresponding path program 1 times [2022-12-13 14:29:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66069078] [2022-12-13 14:29:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:39,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:39,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66069078] [2022-12-13 14:29:39,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66069078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:39,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:39,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:29:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001678347] [2022-12-13 14:29:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:39,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:29:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:39,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:29:39,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:29:39,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 211 [2022-12-13 14:29:39,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 188 transitions, 3794 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:39,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 211 [2022-12-13 14:29:39,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:39,851 INFO L130 PetriNetUnfolder]: 518/980 cut-off events. [2022-12-13 14:29:39,851 INFO L131 PetriNetUnfolder]: For 19467/19475 co-relation queries the response was YES. [2022-12-13 14:29:39,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6676 conditions, 980 events. 518/980 cut-off events. For 19467/19475 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4947 event pairs, 150 based on Foata normal form. 71/1051 useless extension candidates. Maximal degree in co-relation 6604. Up to 830 conditions per place. [2022-12-13 14:29:39,856 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 124 selfloop transitions, 4 changer transitions 1/130 dead transitions. [2022-12-13 14:29:39,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 130 transitions, 2793 flow [2022-12-13 14:29:39,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:29:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:29:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2022-12-13 14:29:39,857 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5055292259083728 [2022-12-13 14:29:39,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2022-12-13 14:29:39,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2022-12-13 14:29:39,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:39,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2022-12-13 14:29:39,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,858 INFO L175 Difference]: Start difference. First operand has 164 places, 188 transitions, 3794 flow. Second operand 3 states and 320 transitions. [2022-12-13 14:29:39,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 130 transitions, 2793 flow [2022-12-13 14:29:39,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 130 transitions, 2379 flow, removed 65 selfloop flow, removed 51 redundant places. [2022-12-13 14:29:39,887 INFO L231 Difference]: Finished difference. Result has 106 places, 105 transitions, 1706 flow [2022-12-13 14:29:39,887 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1706, PETRI_PLACES=106, PETRI_TRANSITIONS=105} [2022-12-13 14:29:39,887 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 71 predicate places. [2022-12-13 14:29:39,887 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 105 transitions, 1706 flow [2022-12-13 14:29:39,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,888 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:39,888 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:39,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 14:29:39,888 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1192148515, now seen corresponding path program 1 times [2022-12-13 14:29:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:39,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552212861] [2022-12-13 14:29:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:39,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:39,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:39,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552212861] [2022-12-13 14:29:39,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552212861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:39,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:39,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:29:39,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555425568] [2022-12-13 14:29:39,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:39,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:29:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:39,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:29:39,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:29:39,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 211 [2022-12-13 14:29:39,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 105 transitions, 1706 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:39,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:39,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 211 [2022-12-13 14:29:39,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:40,118 INFO L130 PetriNetUnfolder]: 217/482 cut-off events. [2022-12-13 14:29:40,118 INFO L131 PetriNetUnfolder]: For 5528/5533 co-relation queries the response was YES. [2022-12-13 14:29:40,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 482 events. 217/482 cut-off events. For 5528/5533 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2206 event pairs, 35 based on Foata normal form. 57/538 useless extension candidates. Maximal degree in co-relation 3067. Up to 229 conditions per place. [2022-12-13 14:29:40,120 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 103 selfloop transitions, 7 changer transitions 2/113 dead transitions. [2022-12-13 14:29:40,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 113 transitions, 2046 flow [2022-12-13 14:29:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:29:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:29:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2022-12-13 14:29:40,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 14:29:40,121 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2022-12-13 14:29:40,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2022-12-13 14:29:40,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:40,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2022-12-13 14:29:40,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,123 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,123 INFO L175 Difference]: Start difference. First operand has 106 places, 105 transitions, 1706 flow. Second operand 4 states and 422 transitions. [2022-12-13 14:29:40,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 113 transitions, 2046 flow [2022-12-13 14:29:40,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 113 transitions, 1806 flow, removed 28 selfloop flow, removed 17 redundant places. [2022-12-13 14:29:40,132 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 1106 flow [2022-12-13 14:29:40,132 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1106, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2022-12-13 14:29:40,132 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2022-12-13 14:29:40,132 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 1106 flow [2022-12-13 14:29:40,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,133 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:40,133 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] [2022-12-13 14:29:40,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 14:29:40,133 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2020527554, now seen corresponding path program 1 times [2022-12-13 14:29:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:40,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146241655] [2022-12-13 14:29:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:40,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:40,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146241655] [2022-12-13 14:29:40,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146241655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:40,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:40,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:29:40,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285923062] [2022-12-13 14:29:40,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:40,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:29:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:40,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:29:40,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:29:40,255 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 211 [2022-12-13 14:29:40,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 1106 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:40,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 211 [2022-12-13 14:29:40,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:40,367 INFO L130 PetriNetUnfolder]: 153/340 cut-off events. [2022-12-13 14:29:40,367 INFO L131 PetriNetUnfolder]: For 3087/3092 co-relation queries the response was YES. [2022-12-13 14:29:40,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2233 conditions, 340 events. 153/340 cut-off events. For 3087/3092 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1420 event pairs, 17 based on Foata normal form. 28/367 useless extension candidates. Maximal degree in co-relation 2196. Up to 133 conditions per place. [2022-12-13 14:29:40,368 INFO L137 encePairwiseOnDemand]: 206/211 looper letters, 63 selfloop transitions, 10 changer transitions 35/109 dead transitions. [2022-12-13 14:29:40,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 109 transitions, 1755 flow [2022-12-13 14:29:40,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:29:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:29:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2022-12-13 14:29:40,369 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4900473933649289 [2022-12-13 14:29:40,369 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2022-12-13 14:29:40,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2022-12-13 14:29:40,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:40,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2022-12-13 14:29:40,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,371 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 1106 flow. Second operand 5 states and 517 transitions. [2022-12-13 14:29:40,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 109 transitions, 1755 flow [2022-12-13 14:29:40,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 109 transitions, 1623 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-13 14:29:40,377 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 651 flow [2022-12-13 14:29:40,377 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=651, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2022-12-13 14:29:40,377 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 54 predicate places. [2022-12-13 14:29:40,377 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 651 flow [2022-12-13 14:29:40,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:40,378 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:40,378 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] [2022-12-13 14:29:40,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 14:29:40,378 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:40,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1584408152, now seen corresponding path program 1 times [2022-12-13 14:29:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:40,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739709834] [2022-12-13 14:29:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:41,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:41,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739709834] [2022-12-13 14:29:41,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739709834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:41,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:41,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 14:29:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369887347] [2022-12-13 14:29:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:41,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 14:29:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:41,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 14:29:41,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:29:41,271 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 211 [2022-12-13 14:29:41,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 651 flow. Second operand has 11 states, 11 states have (on average 90.9090909090909) internal successors, (1000), 11 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-12-13 14:29:41,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:41,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 211 [2022-12-13 14:29:41,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:41,590 INFO L130 PetriNetUnfolder]: 105/257 cut-off events. [2022-12-13 14:29:41,590 INFO L131 PetriNetUnfolder]: For 1754/1754 co-relation queries the response was YES. [2022-12-13 14:29:41,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 257 events. 105/257 cut-off events. For 1754/1754 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1004 event pairs, 9 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 1502. Up to 155 conditions per place. [2022-12-13 14:29:41,591 INFO L137 encePairwiseOnDemand]: 201/211 looper letters, 43 selfloop transitions, 14 changer transitions 34/92 dead transitions. [2022-12-13 14:29:41,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 92 transitions, 1102 flow [2022-12-13 14:29:41,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:29:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 14:29:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1035 transitions. [2022-12-13 14:29:41,593 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44592847910383454 [2022-12-13 14:29:41,593 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1035 transitions. [2022-12-13 14:29:41,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1035 transitions. [2022-12-13 14:29:41,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:41,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1035 transitions. [2022-12-13 14:29:41,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 94.0909090909091) internal successors, (1035), 11 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:41,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:41,596 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 211.0) internal successors, (2532), 12 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:41,596 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 651 flow. Second operand 11 states and 1035 transitions. [2022-12-13 14:29:41,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 92 transitions, 1102 flow [2022-12-13 14:29:41,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 92 transitions, 922 flow, removed 40 selfloop flow, removed 15 redundant places. [2022-12-13 14:29:41,600 INFO L231 Difference]: Finished difference. Result has 86 places, 51 transitions, 521 flow [2022-12-13 14:29:41,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=521, PETRI_PLACES=86, PETRI_TRANSITIONS=51} [2022-12-13 14:29:41,601 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2022-12-13 14:29:41,601 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 51 transitions, 521 flow [2022-12-13 14:29:41,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.9090909090909) internal successors, (1000), 11 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-12-13 14:29:41,601 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:41,601 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] [2022-12-13 14:29:41,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 14:29:41,601 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:41,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1407464466, now seen corresponding path program 2 times [2022-12-13 14:29:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:41,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719774483] [2022-12-13 14:29:41,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:42,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719774483] [2022-12-13 14:29:42,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719774483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:42,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:42,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:29:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422820513] [2022-12-13 14:29:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:42,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:29:42,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:42,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:29:42,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:29:42,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 211 [2022-12-13 14:29:42,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 51 transitions, 521 flow. Second operand has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:42,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:42,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 211 [2022-12-13 14:29:42,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:42,479 INFO L130 PetriNetUnfolder]: 81/208 cut-off events. [2022-12-13 14:29:42,479 INFO L131 PetriNetUnfolder]: For 986/986 co-relation queries the response was YES. [2022-12-13 14:29:42,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 208 events. 81/208 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 754 event pairs, 21 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 1094. Up to 133 conditions per place. [2022-12-13 14:29:42,480 INFO L137 encePairwiseOnDemand]: 202/211 looper letters, 38 selfloop transitions, 13 changer transitions 23/75 dead transitions. [2022-12-13 14:29:42,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 75 transitions, 795 flow [2022-12-13 14:29:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:29:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 14:29:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 864 transitions. [2022-12-13 14:29:42,481 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4549763033175355 [2022-12-13 14:29:42,481 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 864 transitions. [2022-12-13 14:29:42,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 864 transitions. [2022-12-13 14:29:42,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:42,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 864 transitions. [2022-12-13 14:29:42,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.0) internal successors, (864), 9 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:42,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:42,483 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:42,483 INFO L175 Difference]: Start difference. First operand has 86 places, 51 transitions, 521 flow. Second operand 9 states and 864 transitions. [2022-12-13 14:29:42,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 75 transitions, 795 flow [2022-12-13 14:29:42,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 721 flow, removed 12 selfloop flow, removed 11 redundant places. [2022-12-13 14:29:42,486 INFO L231 Difference]: Finished difference. Result has 79 places, 47 transitions, 430 flow [2022-12-13 14:29:42,487 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=430, PETRI_PLACES=79, PETRI_TRANSITIONS=47} [2022-12-13 14:29:42,487 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2022-12-13 14:29:42,487 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 47 transitions, 430 flow [2022-12-13 14:29:42,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.625) internal successors, (749), 8 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:42,487 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:42,487 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] [2022-12-13 14:29:42,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 14:29:42,487 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash -105416104, now seen corresponding path program 3 times [2022-12-13 14:29:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:42,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969775913] [2022-12-13 14:29:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:42,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:29:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:29:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:29:43,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969775913] [2022-12-13 14:29:43,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969775913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:29:43,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:29:43,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:29:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813382261] [2022-12-13 14:29:43,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:29:43,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:29:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:29:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:29:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:29:43,123 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 211 [2022-12-13 14:29:43,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 47 transitions, 430 flow. Second operand has 9 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:43,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:29:43,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 211 [2022-12-13 14:29:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:29:43,362 INFO L130 PetriNetUnfolder]: 66/170 cut-off events. [2022-12-13 14:29:43,362 INFO L131 PetriNetUnfolder]: For 602/602 co-relation queries the response was YES. [2022-12-13 14:29:43,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 170 events. 66/170 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 548 event pairs, 7 based on Foata normal form. 1/171 useless extension candidates. Maximal degree in co-relation 843. Up to 73 conditions per place. [2022-12-13 14:29:43,362 INFO L137 encePairwiseOnDemand]: 203/211 looper letters, 29 selfloop transitions, 6 changer transitions 39/75 dead transitions. [2022-12-13 14:29:43,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 736 flow [2022-12-13 14:29:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:29:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 14:29:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 845 transitions. [2022-12-13 14:29:43,364 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.444971037388099 [2022-12-13 14:29:43,364 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 845 transitions. [2022-12-13 14:29:43,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 845 transitions. [2022-12-13 14:29:43,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:29:43,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 845 transitions. [2022-12-13 14:29:43,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.88888888888889) internal successors, (845), 9 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:43,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:43,366 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:43,366 INFO L175 Difference]: Start difference. First operand has 79 places, 47 transitions, 430 flow. Second operand 9 states and 845 transitions. [2022-12-13 14:29:43,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 736 flow [2022-12-13 14:29:43,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 682 flow, removed 5 selfloop flow, removed 10 redundant places. [2022-12-13 14:29:43,369 INFO L231 Difference]: Finished difference. Result has 76 places, 30 transitions, 216 flow [2022-12-13 14:29:43,369 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=76, PETRI_TRANSITIONS=30} [2022-12-13 14:29:43,369 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 41 predicate places. [2022-12-13 14:29:43,369 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 30 transitions, 216 flow [2022-12-13 14:29:43,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.33333333333333) internal successors, (822), 9 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:29:43,369 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:29:43,369 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] [2022-12-13 14:29:43,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 14:29:43,369 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:29:43,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:29:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash -639662558, now seen corresponding path program 4 times [2022-12-13 14:29:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:29:43,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088821259] [2022-12-13 14:29:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:29:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:29:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:29:43,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:29:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:29:43,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:29:43,441 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:29:43,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 14:29:43,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 14:29:43,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 14:29:43,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 14:29:43,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 14:29:43,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 14:29:43,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 14:29:43,443 INFO L445 BasicCegarLoop]: Path program histogram: [8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:29:43,448 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 14:29:43,448 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:29:43,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:29:43 BasicIcfg [2022-12-13 14:29:43,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:29:43,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:29:43,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:29:43,485 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:29:43,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:28:59" (3/4) ... [2022-12-13 14:29:43,486 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 14:29:43,534 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:29:43,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:29:43,535 INFO L158 Benchmark]: Toolchain (without parser) took 44645.74ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 90.6MB in the beginning and 311.1MB in the end (delta: -220.5MB). Peak memory consumption was 802.6MB. Max. memory is 16.1GB. [2022-12-13 14:29:43,535 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 155.2MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:29:43,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.13ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 104.1MB in the end (delta: -13.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-12-13 14:29:43,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.04ms. Allocated memory is still 155.2MB. Free memory was 104.1MB in the beginning and 101.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:29:43,535 INFO L158 Benchmark]: Boogie Preprocessor took 20.71ms. Allocated memory is still 155.2MB. Free memory was 101.5MB in the beginning and 99.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:29:43,536 INFO L158 Benchmark]: RCFGBuilder took 627.97ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 51.7MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-12-13 14:29:43,536 INFO L158 Benchmark]: TraceAbstraction took 43504.30ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 50.7MB in the beginning and 321.6MB in the end (delta: -270.9MB). Peak memory consumption was 753.5MB. Max. memory is 16.1GB. [2022-12-13 14:29:43,536 INFO L158 Benchmark]: Witness Printer took 49.76ms. Allocated memory is still 1.2GB. Free memory was 321.6MB in the beginning and 311.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 14:29:43,537 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.21ms. Allocated memory is still 155.2MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.13ms. Allocated memory is still 155.2MB. Free memory was 90.4MB in the beginning and 104.1MB in the end (delta: -13.7MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.04ms. Allocated memory is still 155.2MB. Free memory was 104.1MB in the beginning and 101.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.71ms. Allocated memory is still 155.2MB. Free memory was 101.5MB in the beginning and 99.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 627.97ms. Allocated memory is still 155.2MB. Free memory was 99.0MB in the beginning and 51.7MB in the end (delta: 47.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43504.30ms. Allocated memory was 155.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 50.7MB in the beginning and 321.6MB in the end (delta: -270.9MB). Peak memory consumption was 753.5MB. Max. memory is 16.1GB. * Witness Printer took 49.76ms. Allocated memory is still 1.2GB. Free memory was 321.6MB in the beginning and 311.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 119 PlacesBefore, 35 PlacesAfterwards, 111 TransitionsBefore, 26 TransitionsAfterwards, 2052 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, 5491 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2052, independent: 1862, independent conditional: 0, independent unconditional: 1862, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1048, independent: 1022, independent conditional: 0, independent unconditional: 1022, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2052, independent: 840, independent conditional: 0, independent unconditional: 840, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 1048, unknown conditional: 0, unknown unconditional: 1048] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2537, ((void *)0), P0, ((void *)0))=-3, t2537={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2538, ((void *)0), P1, ((void *)0))=-2, t2537={5:0}, t2538={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2539, ((void *)0), P2, ((void *)0))=-1, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537={5:0}, t2538={6:0}, t2539={3:0}, weak$$choice0=67, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: 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: 852]: 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: 850]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 43.4s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2585 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2227 mSDsluCounter, 3011 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2888 mSDsCounter, 1044 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7141 IncrementalHoareTripleChecker+Invalid, 8185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1044 mSolverCounterUnsat, 123 mSDtfsCounter, 7141 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6965occurred in iteration=13, InterpolantAutomatonStates: 239, 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.5s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 6400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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-12-13 14:29:43,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_131c4ebf-fa1b-4d14-9e25-88cffe174f38/bin/uautomizer-uyxdKDjOR8/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