./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_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_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/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_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/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_6d99b53a-efab-4171-9a2f-c50a59a6ace8/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 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- 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 20:54:48,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:54:48,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:54:48,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:54:48,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:54:48,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:54:48,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:54:48,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:54:48,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:54:48,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:54:48,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:54:48,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:54:48,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:54:48,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:54:48,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:54:48,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:54:48,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:54:48,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:54:48,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:54:48,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:54:48,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:54:48,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:54:48,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:54:48,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:54:48,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:54:48,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:54:48,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:54:48,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:54:48,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:54:48,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:54:48,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:54:48,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:54:48,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:54:48,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:54:48,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:54:48,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:54:48,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:54:48,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:54:48,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:54:48,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:54:48,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:54:48,935 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:54:48,948 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:54:48,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:54:48,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:54:48,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:54:48,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:54:48,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:54:48,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:54:48,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:54:48,950 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:54:48,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:54:48,950 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:54:48,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:54:48,952 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:54:48,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:54:48,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:54:48,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:54:48,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:54:48,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:54:48,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:54:48,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:54:48,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:54:48,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:54:48,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:54:48,953 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:54:48,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:54:48,953 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:54:48,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:54:48,954 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:54:48,954 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_6d99b53a-efab-4171-9a2f-c50a59a6ace8/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_6d99b53a-efab-4171-9a2f-c50a59a6ace8/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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2022-12-13 20:54:49,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:54:49,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:54:49,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:54:49,146 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:54:49,146 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:54:49,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 20:54:51,789 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:54:52,022 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:54:52,022 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 20:54:52,035 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/data/84d6426a6/1c659f31da7e47e086824cca73578eda/FLAG93a48ef15 [2022-12-13 20:54:52,048 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/data/84d6426a6/1c659f31da7e47e086824cca73578eda [2022-12-13 20:54:52,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:54:52,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:54:52,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:54:52,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:54:52,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:54:52,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e2d0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52, skipping insertion in model container [2022-12-13 20:54:52,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:54:52,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:54:52,217 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_6d99b53a-efab-4171-9a2f-c50a59a6ace8/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 20:54:52,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:54:52,356 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:54:52,365 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_6d99b53a-efab-4171-9a2f-c50a59a6ace8/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 20:54:52,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:54:52,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:54:52,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:54:52,418 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:54:52,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52 WrapperNode [2022-12-13 20:54:52,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:54:52,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:54:52,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:54:52,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:54:52,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,460 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 20:54:52,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:54:52,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:54:52,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:54:52,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:54:52,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:54:52,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:54:52,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:54:52,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:54:52,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (1/1) ... [2022-12-13 20:54:52,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:54:52,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:54:52,518 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:54:52,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:54:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:54:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 20:54:52,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:54:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:54:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:54:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 20:54:52,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 20:54:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 20:54:52,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 20:54:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 20:54:52,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 20:54:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:54:52,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 20:54:52,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:54:52,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:54:52,554 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 20:54:52,668 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:54:52,670 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:54:52,902 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:54:53,006 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:54:53,006 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:54:53,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:53 BoogieIcfgContainer [2022-12-13 20:54:53,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:54:53,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:54:53,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:54:53,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:54:53,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:54:52" (1/3) ... [2022-12-13 20:54:53,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa42f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:54:53, skipping insertion in model container [2022-12-13 20:54:53,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:54:52" (2/3) ... [2022-12-13 20:54:53,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa42f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:54:53, skipping insertion in model container [2022-12-13 20:54:53,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:53" (3/3) ... [2022-12-13 20:54:53,015 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 20:54:53,021 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 20:54:53,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:54:53,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 20:54:53,030 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:54:53,075 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 20:54:53,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 20:54:53,160 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 20:54:53,160 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:54:53,165 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 55 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 20:54:53,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-13 20:54:53,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-13 20:54:53,173 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:54:53,181 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 20:54:53,183 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-13 20:54:53,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-13 20:54:53,210 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-13 20:54:53,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:54:53,211 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 55 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 20:54:53,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 20:54:56,536 INFO L134 LiptonReduction]: Checked pairs total: 5227 [2022-12-13 20:54:56,536 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-12-13 20:54:56,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:54:56,555 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;@27f13e87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:54:56,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 20:54:56,557 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 20:54:56,558 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:54:56,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:54:56,558 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 20:54:56,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:54:56,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 489298, now seen corresponding path program 1 times [2022-12-13 20:54:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:56,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367871856] [2022-12-13 20:54:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:56,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:56,867 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 20:54:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:56,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367871856] [2022-12-13 20:54:56,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367871856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:54:56,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:54:56,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:54:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061452264] [2022-12-13 20:54:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:54:56,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:54:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:54:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:54:56,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:54:56,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 216 [2022-12-13 20:54:56,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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 20:54:56,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:54:56,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 216 [2022-12-13 20:54:56,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:54:57,165 INFO L130 PetriNetUnfolder]: 711/1166 cut-off events. [2022-12-13 20:54:57,165 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 20:54:57,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1166 events. 711/1166 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6142 event pairs, 111 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 2274. Up to 871 conditions per place. [2022-12-13 20:54:57,175 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-12-13 20:54:57,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2022-12-13 20:54:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:54:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:54:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-12-13 20:54:57,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2022-12-13 20:54:57,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-12-13 20:54:57,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-12-13 20:54:57,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:54:57,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-12-13 20:54:57,195 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 20:54:57,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 20:54:57,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 20:54:57,206 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 334 transitions. [2022-12-13 20:54:57,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2022-12-13 20:54:57,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 20:54:57,210 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-12-13 20:54:57,211 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 20:54:57,214 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 20:54:57,214 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-12-13 20:54:57,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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 20:54:57,214 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:54:57,214 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:57,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:54:57,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:54:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 181922046, now seen corresponding path program 1 times [2022-12-13 20:54:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:57,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278758251] [2022-12-13 20:54:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:57,863 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 20:54:57,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:57,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278758251] [2022-12-13 20:54:57,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278758251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:54:57,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:54:57,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:54:57,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511514982] [2022-12-13 20:54:57,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:54:57,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:54:57,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:54:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:54:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:54:57,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2022-12-13 20:54:57,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 20:54:57,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:54:57,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2022-12-13 20:54:57,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:54:58,133 INFO L130 PetriNetUnfolder]: 830/1331 cut-off events. [2022-12-13 20:54:58,133 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-13 20:54:58,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2720 conditions, 1331 events. 830/1331 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6505 event pairs, 134 based on Foata normal form. 24/1353 useless extension candidates. Maximal degree in co-relation 2710. Up to 1069 conditions per place. [2022-12-13 20:54:58,138 INFO L137 encePairwiseOnDemand]: 207/216 looper letters, 34 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2022-12-13 20:54:58,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 200 flow [2022-12-13 20:54:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:54:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:54:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2022-12-13 20:54:58,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 20:54:58,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2022-12-13 20:54:58,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2022-12-13 20:54:58,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:54:58,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2022-12-13 20:54:58,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 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 20:54:58,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:54:58,144 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:54:58,144 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 414 transitions. [2022-12-13 20:54:58,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 200 flow [2022-12-13 20:54:58,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:54:58,145 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2022-12-13 20:54:58,145 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2022-12-13 20:54:58,145 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2022-12-13 20:54:58,145 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2022-12-13 20:54:58,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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 20:54:58,146 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:54:58,146 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:58,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:54:58,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:54:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:58,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1344615071, now seen corresponding path program 1 times [2022-12-13 20:54:58,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:58,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145561804] [2022-12-13 20:54:58,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:58,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:58,257 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 20:54:58,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:58,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145561804] [2022-12-13 20:54:58,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145561804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:54:58,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:54:58,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:54:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792860983] [2022-12-13 20:54:58,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:54:58,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:54:58,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:54:58,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:54:58,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:54:58,261 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 216 [2022-12-13 20:54:58,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 20:54:58,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:54:58,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 216 [2022-12-13 20:54:58,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:54:58,447 INFO L130 PetriNetUnfolder]: 722/1179 cut-off events. [2022-12-13 20:54:58,447 INFO L131 PetriNetUnfolder]: For 497/523 co-relation queries the response was YES. [2022-12-13 20:54:58,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3200 conditions, 1179 events. 722/1179 cut-off events. For 497/523 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5661 event pairs, 143 based on Foata normal form. 42/1214 useless extension candidates. Maximal degree in co-relation 3188. Up to 809 conditions per place. [2022-12-13 20:54:58,452 INFO L137 encePairwiseOnDemand]: 213/216 looper letters, 35 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-13 20:54:58,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 236 flow [2022-12-13 20:54:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:54:58,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:54:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-12-13 20:54:58,454 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 20:54:58,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2022-12-13 20:54:58,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2022-12-13 20:54:58,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:54:58,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2022-12-13 20:54:58,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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 20:54:58,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 20:54:58,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 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 20:54:58,457 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 3 states and 324 transitions. [2022-12-13 20:54:58,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 236 flow [2022-12-13 20:54:58,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:54:58,458 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 122 flow [2022-12-13 20:54:58,458 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-13 20:54:58,459 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2022-12-13 20:54:58,459 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 122 flow [2022-12-13 20:54:58,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 20:54:58,459 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:54:58,459 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:54:58,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:54:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 63666701, now seen corresponding path program 1 times [2022-12-13 20:54:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137055550] [2022-12-13 20:54:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:58,897 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 20:54:58,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137055550] [2022-12-13 20:54:58,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137055550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:54:58,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:54:58,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:54:58,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816869604] [2022-12-13 20:54:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:54:58,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:54:58,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:54:58,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:54:58,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:54:58,951 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2022-12-13 20:54:58,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 20:54:58,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:54:58,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2022-12-13 20:54:58,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:54:59,349 INFO L130 PetriNetUnfolder]: 1105/1675 cut-off events. [2022-12-13 20:54:59,349 INFO L131 PetriNetUnfolder]: For 1005/1005 co-relation queries the response was YES. [2022-12-13 20:54:59,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4871 conditions, 1675 events. 1105/1675 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7682 event pairs, 128 based on Foata normal form. 13/1678 useless extension candidates. Maximal degree in co-relation 4856. Up to 911 conditions per place. [2022-12-13 20:54:59,360 INFO L137 encePairwiseOnDemand]: 205/216 looper letters, 46 selfloop transitions, 27 changer transitions 0/74 dead transitions. [2022-12-13 20:54:59,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 435 flow [2022-12-13 20:54:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:54:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:54:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-12-13 20:54:59,362 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2022-12-13 20:54:59,363 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2022-12-13 20:54:59,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2022-12-13 20:54:59,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:54:59,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2022-12-13 20:54:59,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 20:54:59,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:54:59,367 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:54:59,367 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 122 flow. Second operand 5 states and 512 transitions. [2022-12-13 20:54:59,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 435 flow [2022-12-13 20:54:59,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 74 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:54:59,371 INFO L231 Difference]: Finished difference. Result has 42 places, 49 transitions, 345 flow [2022-12-13 20:54:59,371 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=42, PETRI_TRANSITIONS=49} [2022-12-13 20:54:59,372 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2022-12-13 20:54:59,372 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 49 transitions, 345 flow [2022-12-13 20:54:59,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 4 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 20:54:59,372 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:54:59,372 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:54:59,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:54:59,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:54:59,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:54:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1304112199, now seen corresponding path program 2 times [2022-12-13 20:54:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:54:59,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124818207] [2022-12-13 20:54:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:54:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:54:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:54:59,875 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 20:54:59,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:54:59,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124818207] [2022-12-13 20:54:59,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124818207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:54:59,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:54:59,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:54:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911598308] [2022-12-13 20:54:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:54:59,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:54:59,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:54:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:54:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:54:59,906 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2022-12-13 20:54:59,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 49 transitions, 345 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 20:54:59,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:54:59,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2022-12-13 20:54:59,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:00,227 INFO L130 PetriNetUnfolder]: 1339/2097 cut-off events. [2022-12-13 20:55:00,227 INFO L131 PetriNetUnfolder]: For 4738/4810 co-relation queries the response was YES. [2022-12-13 20:55:00,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8189 conditions, 2097 events. 1339/2097 cut-off events. For 4738/4810 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10322 event pairs, 215 based on Foata normal form. 129/2224 useless extension candidates. Maximal degree in co-relation 8170. Up to 925 conditions per place. [2022-12-13 20:55:00,236 INFO L137 encePairwiseOnDemand]: 207/216 looper letters, 46 selfloop transitions, 10 changer transitions 20/77 dead transitions. [2022-12-13 20:55:00,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 650 flow [2022-12-13 20:55:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:55:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:55:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-12-13 20:55:00,237 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2022-12-13 20:55:00,237 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2022-12-13 20:55:00,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2022-12-13 20:55:00,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:00,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2022-12-13 20:55:00,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 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 20:55:00,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:00,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:00,240 INFO L175 Difference]: Start difference. First operand has 42 places, 49 transitions, 345 flow. Second operand 5 states and 500 transitions. [2022-12-13 20:55:00,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 650 flow [2022-12-13 20:55:00,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 650 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 20:55:00,249 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 328 flow [2022-12-13 20:55:00,249 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-13 20:55:00,250 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-13 20:55:00,250 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 328 flow [2022-12-13 20:55:00,250 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 20:55:00,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:00,250 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:00,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:55:00,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:00,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1973617320, now seen corresponding path program 1 times [2022-12-13 20:55:00,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:00,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904731148] [2022-12-13 20:55:00,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:00,668 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 20:55:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:00,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904731148] [2022-12-13 20:55:00,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904731148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:00,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:00,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621652082] [2022-12-13 20:55:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:00,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:00,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:00,685 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 216 [2022-12-13 20:55:00,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 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 20:55:00,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:00,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 216 [2022-12-13 20:55:00,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:00,875 INFO L130 PetriNetUnfolder]: 737/1159 cut-off events. [2022-12-13 20:55:00,875 INFO L131 PetriNetUnfolder]: For 3461/3506 co-relation queries the response was YES. [2022-12-13 20:55:00,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5115 conditions, 1159 events. 737/1159 cut-off events. For 3461/3506 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4820 event pairs, 318 based on Foata normal form. 35/1178 useless extension candidates. Maximal degree in co-relation 5090. Up to 1014 conditions per place. [2022-12-13 20:55:00,885 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 44 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2022-12-13 20:55:00,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 520 flow [2022-12-13 20:55:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:55:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:55:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-12-13 20:55:00,887 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49421296296296297 [2022-12-13 20:55:00,887 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2022-12-13 20:55:00,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2022-12-13 20:55:00,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:00,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2022-12-13 20:55:00,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 20:55:00,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:00,890 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:00,891 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 328 flow. Second operand 4 states and 427 transitions. [2022-12-13 20:55:00,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 520 flow [2022-12-13 20:55:00,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 473 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 20:55:00,898 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 360 flow [2022-12-13 20:55:00,898 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2022-12-13 20:55:00,899 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-13 20:55:00,899 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 360 flow [2022-12-13 20:55:00,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 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 20:55:00,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:00,900 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:00,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:55:00,900 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash 813291742, now seen corresponding path program 1 times [2022-12-13 20:55:00,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:00,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379680126] [2022-12-13 20:55:00,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:00,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:01,338 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 20:55:01,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:01,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379680126] [2022-12-13 20:55:01,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379680126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:01,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:01,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:01,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719127111] [2022-12-13 20:55:01,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:01,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:01,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:01,350 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 216 [2022-12-13 20:55:01,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 20:55:01,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:01,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 216 [2022-12-13 20:55:01,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:01,555 INFO L130 PetriNetUnfolder]: 775/1217 cut-off events. [2022-12-13 20:55:01,555 INFO L131 PetriNetUnfolder]: For 3570/3626 co-relation queries the response was YES. [2022-12-13 20:55:01,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 1217 events. 775/1217 cut-off events. For 3570/3626 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5147 event pairs, 208 based on Foata normal form. 56/1268 useless extension candidates. Maximal degree in co-relation 5586. Up to 997 conditions per place. [2022-12-13 20:55:01,561 INFO L137 encePairwiseOnDemand]: 208/216 looper letters, 64 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2022-12-13 20:55:01,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 904 flow [2022-12-13 20:55:01,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:55:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:55:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-12-13 20:55:01,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 20:55:01,564 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2022-12-13 20:55:01,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2022-12-13 20:55:01,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:01,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2022-12-13 20:55:01,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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 20:55:01,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:01,568 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:01,568 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 360 flow. Second operand 5 states and 540 transitions. [2022-12-13 20:55:01,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 904 flow [2022-12-13 20:55:01,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 874 flow, removed 15 selfloop flow, removed 0 redundant places. [2022-12-13 20:55:01,575 INFO L231 Difference]: Finished difference. Result has 56 places, 68 transitions, 655 flow [2022-12-13 20:55:01,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=56, PETRI_TRANSITIONS=68} [2022-12-13 20:55:01,576 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2022-12-13 20:55:01,576 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 68 transitions, 655 flow [2022-12-13 20:55:01,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 20:55:01,577 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:01,577 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:01,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:55:01,577 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash 150902712, now seen corresponding path program 2 times [2022-12-13 20:55:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:01,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704508603] [2022-12-13 20:55:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:01,826 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 20:55:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:01,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704508603] [2022-12-13 20:55:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704508603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187924751] [2022-12-13 20:55:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:01,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:01,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:01,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 216 [2022-12-13 20:55:01,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 68 transitions, 655 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 20:55:01,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:01,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 216 [2022-12-13 20:55:01,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:02,059 INFO L130 PetriNetUnfolder]: 826/1305 cut-off events. [2022-12-13 20:55:02,060 INFO L131 PetriNetUnfolder]: For 5926/6000 co-relation queries the response was YES. [2022-12-13 20:55:02,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6851 conditions, 1305 events. 826/1305 cut-off events. For 5926/6000 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5666 event pairs, 220 based on Foata normal form. 73/1373 useless extension candidates. Maximal degree in co-relation 6823. Up to 1020 conditions per place. [2022-12-13 20:55:02,066 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 67 selfloop transitions, 23 changer transitions 0/96 dead transitions. [2022-12-13 20:55:02,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 96 transitions, 1030 flow [2022-12-13 20:55:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:55:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:55:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2022-12-13 20:55:02,067 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 20:55:02,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2022-12-13 20:55:02,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2022-12-13 20:55:02,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:02,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2022-12-13 20:55:02,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 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 20:55:02,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:02,069 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:02,069 INFO L175 Difference]: Start difference. First operand has 56 places, 68 transitions, 655 flow. Second operand 4 states and 432 transitions. [2022-12-13 20:55:02,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 96 transitions, 1030 flow [2022-12-13 20:55:02,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 1018 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-13 20:55:02,076 INFO L231 Difference]: Finished difference. Result has 60 places, 74 transitions, 789 flow [2022-12-13 20:55:02,076 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=789, PETRI_PLACES=60, PETRI_TRANSITIONS=74} [2022-12-13 20:55:02,077 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2022-12-13 20:55:02,077 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 74 transitions, 789 flow [2022-12-13 20:55:02,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 20:55:02,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:02,077 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:02,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:55:02,078 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash -557762724, now seen corresponding path program 1 times [2022-12-13 20:55:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:02,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610079948] [2022-12-13 20:55:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:02,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:02,463 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 20:55:02,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:02,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610079948] [2022-12-13 20:55:02,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610079948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:02,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:02,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889484249] [2022-12-13 20:55:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:02,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:02,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2022-12-13 20:55:02,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 74 transitions, 789 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 20:55:02,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:02,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2022-12-13 20:55:02,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:02,729 INFO L130 PetriNetUnfolder]: 816/1292 cut-off events. [2022-12-13 20:55:02,729 INFO L131 PetriNetUnfolder]: For 7323/7393 co-relation queries the response was YES. [2022-12-13 20:55:02,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7281 conditions, 1292 events. 816/1292 cut-off events. For 7323/7393 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5583 event pairs, 210 based on Foata normal form. 67/1358 useless extension candidates. Maximal degree in co-relation 7250. Up to 913 conditions per place. [2022-12-13 20:55:02,735 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 70 selfloop transitions, 21 changer transitions 0/97 dead transitions. [2022-12-13 20:55:02,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 97 transitions, 1114 flow [2022-12-13 20:55:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:55:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:55:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2022-12-13 20:55:02,737 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2022-12-13 20:55:02,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2022-12-13 20:55:02,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2022-12-13 20:55:02,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:02,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2022-12-13 20:55:02,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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 20:55:02,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:02,739 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:02,739 INFO L175 Difference]: Start difference. First operand has 60 places, 74 transitions, 789 flow. Second operand 4 states and 436 transitions. [2022-12-13 20:55:02,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 97 transitions, 1114 flow [2022-12-13 20:55:02,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 97 transitions, 1078 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 20:55:02,748 INFO L231 Difference]: Finished difference. Result has 62 places, 77 transitions, 857 flow [2022-12-13 20:55:02,748 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=857, PETRI_PLACES=62, PETRI_TRANSITIONS=77} [2022-12-13 20:55:02,748 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2022-12-13 20:55:02,748 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 77 transitions, 857 flow [2022-12-13 20:55:02,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 20:55:02,749 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:02,749 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:02,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:55:02,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -534730472, now seen corresponding path program 1 times [2022-12-13 20:55:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:02,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46465434] [2022-12-13 20:55:02,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:03,264 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 20:55:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:03,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46465434] [2022-12-13 20:55:03,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46465434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:03,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:03,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698512594] [2022-12-13 20:55:03,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:03,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:03,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:03,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:03,305 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2022-12-13 20:55:03,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 77 transitions, 857 flow. Second operand has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 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 20:55:03,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:03,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2022-12-13 20:55:03,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:03,670 INFO L130 PetriNetUnfolder]: 993/1547 cut-off events. [2022-12-13 20:55:03,670 INFO L131 PetriNetUnfolder]: For 8712/8712 co-relation queries the response was YES. [2022-12-13 20:55:03,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8696 conditions, 1547 events. 993/1547 cut-off events. For 8712/8712 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6685 event pairs, 206 based on Foata normal form. 18/1565 useless extension candidates. Maximal degree in co-relation 8664. Up to 1001 conditions per place. [2022-12-13 20:55:03,677 INFO L137 encePairwiseOnDemand]: 205/216 looper letters, 65 selfloop transitions, 52 changer transitions 0/119 dead transitions. [2022-12-13 20:55:03,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 119 transitions, 1409 flow [2022-12-13 20:55:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:55:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 20:55:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 597 transitions. [2022-12-13 20:55:03,679 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46064814814814814 [2022-12-13 20:55:03,679 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 597 transitions. [2022-12-13 20:55:03,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 597 transitions. [2022-12-13 20:55:03,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:03,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 597 transitions. [2022-12-13 20:55:03,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 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 20:55:03,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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 20:55:03,681 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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 20:55:03,681 INFO L175 Difference]: Start difference. First operand has 62 places, 77 transitions, 857 flow. Second operand 6 states and 597 transitions. [2022-12-13 20:55:03,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 119 transitions, 1409 flow [2022-12-13 20:55:03,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 1375 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 20:55:03,689 INFO L231 Difference]: Finished difference. Result has 67 places, 94 transitions, 1243 flow [2022-12-13 20:55:03,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1243, PETRI_PLACES=67, PETRI_TRANSITIONS=94} [2022-12-13 20:55:03,690 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2022-12-13 20:55:03,690 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 94 transitions, 1243 flow [2022-12-13 20:55:03,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.6) internal successors, (463), 5 states have internal predecessors, (463), 0 states have call successors, (0), 0 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 20:55:03,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:03,690 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:03,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:55:03,691 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash 663601432, now seen corresponding path program 1 times [2022-12-13 20:55:03,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:03,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800549385] [2022-12-13 20:55:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:03,890 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 20:55:03,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:03,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800549385] [2022-12-13 20:55:03,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800549385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:03,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:03,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:03,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565418560] [2022-12-13 20:55:03,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:03,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:03,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:03,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:03,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 216 [2022-12-13 20:55:03,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 94 transitions, 1243 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 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 20:55:03,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:03,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 216 [2022-12-13 20:55:03,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:04,173 INFO L130 PetriNetUnfolder]: 923/1461 cut-off events. [2022-12-13 20:55:04,173 INFO L131 PetriNetUnfolder]: For 12130/12174 co-relation queries the response was YES. [2022-12-13 20:55:04,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9429 conditions, 1461 events. 923/1461 cut-off events. For 12130/12174 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6463 event pairs, 316 based on Foata normal form. 39/1499 useless extension candidates. Maximal degree in co-relation 9395. Up to 1184 conditions per place. [2022-12-13 20:55:04,180 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 87 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2022-12-13 20:55:04,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 112 transitions, 1592 flow [2022-12-13 20:55:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:55:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:55:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2022-12-13 20:55:04,182 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5046296296296297 [2022-12-13 20:55:04,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2022-12-13 20:55:04,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2022-12-13 20:55:04,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:04,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2022-12-13 20:55:04,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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 20:55:04,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:04,185 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:04,185 INFO L175 Difference]: Start difference. First operand has 67 places, 94 transitions, 1243 flow. Second operand 4 states and 436 transitions. [2022-12-13 20:55:04,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 112 transitions, 1592 flow [2022-12-13 20:55:04,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 112 transitions, 1589 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 20:55:04,194 INFO L231 Difference]: Finished difference. Result has 70 places, 97 transitions, 1329 flow [2022-12-13 20:55:04,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1329, PETRI_PLACES=70, PETRI_TRANSITIONS=97} [2022-12-13 20:55:04,195 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2022-12-13 20:55:04,195 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 97 transitions, 1329 flow [2022-12-13 20:55:04,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 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 20:55:04,195 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:04,196 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:04,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:55:04,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:04,196 INFO L85 PathProgramCache]: Analyzing trace with hash -537795752, now seen corresponding path program 2 times [2022-12-13 20:55:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:04,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773177434] [2022-12-13 20:55:04,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:04,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:04,820 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 20:55:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:04,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773177434] [2022-12-13 20:55:04,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773177434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:04,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:04,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:55:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066937414] [2022-12-13 20:55:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:55:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:55:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:55:04,862 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 216 [2022-12-13 20:55:04,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 97 transitions, 1329 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 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 20:55:04,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:04,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 216 [2022-12-13 20:55:04,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:05,209 INFO L130 PetriNetUnfolder]: 1034/1605 cut-off events. [2022-12-13 20:55:05,209 INFO L131 PetriNetUnfolder]: For 13168/13168 co-relation queries the response was YES. [2022-12-13 20:55:05,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10583 conditions, 1605 events. 1034/1605 cut-off events. For 13168/13168 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6993 event pairs, 292 based on Foata normal form. 3/1608 useless extension candidates. Maximal degree in co-relation 10547. Up to 1168 conditions per place. [2022-12-13 20:55:05,216 INFO L137 encePairwiseOnDemand]: 205/216 looper letters, 82 selfloop transitions, 57 changer transitions 0/141 dead transitions. [2022-12-13 20:55:05,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 141 transitions, 1991 flow [2022-12-13 20:55:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:55:05,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:55:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2022-12-13 20:55:05,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4576719576719577 [2022-12-13 20:55:05,218 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2022-12-13 20:55:05,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2022-12-13 20:55:05,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:05,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2022-12-13 20:55:05,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 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 20:55:05,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 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 20:55:05,220 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 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 20:55:05,220 INFO L175 Difference]: Start difference. First operand has 70 places, 97 transitions, 1329 flow. Second operand 7 states and 692 transitions. [2022-12-13 20:55:05,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 141 transitions, 1991 flow [2022-12-13 20:55:05,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 141 transitions, 1961 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 20:55:05,234 INFO L231 Difference]: Finished difference. Result has 78 places, 110 transitions, 1725 flow [2022-12-13 20:55:05,234 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1725, PETRI_PLACES=78, PETRI_TRANSITIONS=110} [2022-12-13 20:55:05,234 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2022-12-13 20:55:05,234 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 110 transitions, 1725 flow [2022-12-13 20:55:05,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 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 20:55:05,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:05,234 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:05,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:55:05,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash 663601649, now seen corresponding path program 1 times [2022-12-13 20:55:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:05,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450836874] [2022-12-13 20:55:05,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:05,455 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 20:55:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:05,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450836874] [2022-12-13 20:55:05,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450836874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:05,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:05,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852055796] [2022-12-13 20:55:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:05,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:05,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:05,464 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 216 [2022-12-13 20:55:05,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 110 transitions, 1725 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 20:55:05,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:05,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 216 [2022-12-13 20:55:05,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:05,731 INFO L130 PetriNetUnfolder]: 976/1546 cut-off events. [2022-12-13 20:55:05,731 INFO L131 PetriNetUnfolder]: For 19026/19072 co-relation queries the response was YES. [2022-12-13 20:55:05,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11309 conditions, 1546 events. 976/1546 cut-off events. For 19026/19072 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6977 event pairs, 306 based on Foata normal form. 47/1592 useless extension candidates. Maximal degree in co-relation 11269. Up to 1238 conditions per place. [2022-12-13 20:55:05,739 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 102 selfloop transitions, 17 changer transitions 0/129 dead transitions. [2022-12-13 20:55:05,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 129 transitions, 2130 flow [2022-12-13 20:55:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:55:05,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:55:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2022-12-13 20:55:05,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5011574074074074 [2022-12-13 20:55:05,740 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2022-12-13 20:55:05,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2022-12-13 20:55:05,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:05,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2022-12-13 20:55:05,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 20:55:05,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:05,742 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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 20:55:05,742 INFO L175 Difference]: Start difference. First operand has 78 places, 110 transitions, 1725 flow. Second operand 4 states and 433 transitions. [2022-12-13 20:55:05,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 129 transitions, 2130 flow [2022-12-13 20:55:05,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 2071 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 20:55:05,764 INFO L231 Difference]: Finished difference. Result has 79 places, 113 transitions, 1764 flow [2022-12-13 20:55:05,764 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1764, PETRI_PLACES=79, PETRI_TRANSITIONS=113} [2022-12-13 20:55:05,764 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2022-12-13 20:55:05,764 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 113 transitions, 1764 flow [2022-12-13 20:55:05,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 20:55:05,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:05,765 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:05,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:55:05,765 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash -537740510, now seen corresponding path program 2 times [2022-12-13 20:55:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:05,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301893393] [2022-12-13 20:55:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:05,999 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 20:55:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:06,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301893393] [2022-12-13 20:55:06,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301893393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:06,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:06,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:55:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180887099] [2022-12-13 20:55:06,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:06,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:55:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:55:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:55:06,013 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 216 [2022-12-13 20:55:06,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 113 transitions, 1764 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 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 20:55:06,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:06,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 216 [2022-12-13 20:55:06,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:06,331 INFO L130 PetriNetUnfolder]: 958/1520 cut-off events. [2022-12-13 20:55:06,331 INFO L131 PetriNetUnfolder]: For 19421/19467 co-relation queries the response was YES. [2022-12-13 20:55:06,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11354 conditions, 1520 events. 958/1520 cut-off events. For 19421/19467 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6851 event pairs, 289 based on Foata normal form. 49/1568 useless extension candidates. Maximal degree in co-relation 11312. Up to 1230 conditions per place. [2022-12-13 20:55:06,339 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 102 selfloop transitions, 22 changer transitions 0/134 dead transitions. [2022-12-13 20:55:06,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 134 transitions, 2165 flow [2022-12-13 20:55:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:55:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:55:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-12-13 20:55:06,340 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2022-12-13 20:55:06,340 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2022-12-13 20:55:06,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2022-12-13 20:55:06,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:06,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2022-12-13 20:55:06,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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 20:55:06,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:06,342 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:06,343 INFO L175 Difference]: Start difference. First operand has 79 places, 113 transitions, 1764 flow. Second operand 5 states and 534 transitions. [2022-12-13 20:55:06,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 134 transitions, 2165 flow [2022-12-13 20:55:06,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 134 transitions, 2129 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 20:55:06,361 INFO L231 Difference]: Finished difference. Result has 83 places, 115 transitions, 1825 flow [2022-12-13 20:55:06,361 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1729, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1825, PETRI_PLACES=83, PETRI_TRANSITIONS=115} [2022-12-13 20:55:06,361 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 50 predicate places. [2022-12-13 20:55:06,362 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 115 transitions, 1825 flow [2022-12-13 20:55:06,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 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 20:55:06,362 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:06,362 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:06,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:55:06,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash -537739022, now seen corresponding path program 3 times [2022-12-13 20:55:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:06,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786844923] [2022-12-13 20:55:06,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:06,604 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 20:55:06,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:06,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786844923] [2022-12-13 20:55:06,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786844923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:06,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:06,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:55:06,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190937746] [2022-12-13 20:55:06,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:06,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:55:06,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:06,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:55:06,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:55:06,620 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2022-12-13 20:55:06,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 115 transitions, 1825 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 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 20:55:06,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:06,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2022-12-13 20:55:06,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:06,904 INFO L130 PetriNetUnfolder]: 969/1540 cut-off events. [2022-12-13 20:55:06,904 INFO L131 PetriNetUnfolder]: For 20399/20445 co-relation queries the response was YES. [2022-12-13 20:55:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11608 conditions, 1540 events. 969/1540 cut-off events. For 20399/20445 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6987 event pairs, 318 based on Foata normal form. 44/1583 useless extension candidates. Maximal degree in co-relation 11564. Up to 1225 conditions per place. [2022-12-13 20:55:06,912 INFO L137 encePairwiseOnDemand]: 208/216 looper letters, 101 selfloop transitions, 32 changer transitions 0/143 dead transitions. [2022-12-13 20:55:06,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 143 transitions, 2423 flow [2022-12-13 20:55:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:55:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:55:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-12-13 20:55:06,914 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2022-12-13 20:55:06,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-12-13 20:55:06,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-12-13 20:55:06,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:06,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-12-13 20:55:06,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 20:55:06,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:06,916 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:06,916 INFO L175 Difference]: Start difference. First operand has 83 places, 115 transitions, 1825 flow. Second operand 5 states and 525 transitions. [2022-12-13 20:55:06,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 143 transitions, 2423 flow [2022-12-13 20:55:06,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 143 transitions, 2386 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 20:55:06,937 INFO L231 Difference]: Finished difference. Result has 87 places, 127 transitions, 2138 flow [2022-12-13 20:55:06,937 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2138, PETRI_PLACES=87, PETRI_TRANSITIONS=127} [2022-12-13 20:55:06,938 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2022-12-13 20:55:06,938 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 127 transitions, 2138 flow [2022-12-13 20:55:06,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 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 20:55:06,938 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:06,938 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:06,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:55:06,938 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1383831811, now seen corresponding path program 1 times [2022-12-13 20:55:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49276100] [2022-12-13 20:55:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:07,024 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 20:55:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:07,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49276100] [2022-12-13 20:55:07,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49276100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:07,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:07,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:55:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248752747] [2022-12-13 20:55:07,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:07,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:55:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:55:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:55:07,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2022-12-13 20:55:07,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 127 transitions, 2138 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 20:55:07,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:07,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2022-12-13 20:55:07,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:07,270 INFO L130 PetriNetUnfolder]: 670/1108 cut-off events. [2022-12-13 20:55:07,270 INFO L131 PetriNetUnfolder]: For 24347/24631 co-relation queries the response was YES. [2022-12-13 20:55:07,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8715 conditions, 1108 events. 670/1108 cut-off events. For 24347/24631 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5238 event pairs, 90 based on Foata normal form. 277/1374 useless extension candidates. Maximal degree in co-relation 8668. Up to 588 conditions per place. [2022-12-13 20:55:07,276 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 125 selfloop transitions, 6 changer transitions 75/223 dead transitions. [2022-12-13 20:55:07,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 223 transitions, 4247 flow [2022-12-13 20:55:07,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:55:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:55:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2022-12-13 20:55:07,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2022-12-13 20:55:07,278 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2022-12-13 20:55:07,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2022-12-13 20:55:07,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:07,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2022-12-13 20:55:07,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 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 20:55:07,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:07,280 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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 20:55:07,280 INFO L175 Difference]: Start difference. First operand has 87 places, 127 transitions, 2138 flow. Second operand 5 states and 532 transitions. [2022-12-13 20:55:07,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 223 transitions, 4247 flow [2022-12-13 20:55:07,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 223 transitions, 4091 flow, removed 35 selfloop flow, removed 3 redundant places. [2022-12-13 20:55:07,297 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 1672 flow [2022-12-13 20:55:07,297 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1672, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2022-12-13 20:55:07,297 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 58 predicate places. [2022-12-13 20:55:07,297 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 1672 flow [2022-12-13 20:55:07,297 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 20:55:07,297 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:07,297 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:07,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 20:55:07,298 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash -201901051, now seen corresponding path program 1 times [2022-12-13 20:55:07,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:07,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004919554] [2022-12-13 20:55:07,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:07,385 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 20:55:07,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:07,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004919554] [2022-12-13 20:55:07,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004919554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:07,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:07,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:55:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349779801] [2022-12-13 20:55:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:07,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:55:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:07,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:55:07,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:55:07,397 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2022-12-13 20:55:07,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 1672 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 20:55:07,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:07,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2022-12-13 20:55:07,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:07,631 INFO L130 PetriNetUnfolder]: 482/823 cut-off events. [2022-12-13 20:55:07,631 INFO L131 PetriNetUnfolder]: For 17718/17919 co-relation queries the response was YES. [2022-12-13 20:55:07,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6494 conditions, 823 events. 482/823 cut-off events. For 17718/17919 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3791 event pairs, 36 based on Foata normal form. 183/996 useless extension candidates. Maximal degree in co-relation 6445. Up to 376 conditions per place. [2022-12-13 20:55:07,635 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 120 selfloop transitions, 10 changer transitions 82/229 dead transitions. [2022-12-13 20:55:07,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 229 transitions, 4220 flow [2022-12-13 20:55:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:55:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:55:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 741 transitions. [2022-12-13 20:55:07,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49007936507936506 [2022-12-13 20:55:07,636 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 741 transitions. [2022-12-13 20:55:07,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 741 transitions. [2022-12-13 20:55:07,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:07,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 741 transitions. [2022-12-13 20:55:07,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 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 20:55:07,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 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 20:55:07,639 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 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 20:55:07,639 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 1672 flow. Second operand 7 states and 741 transitions. [2022-12-13 20:55:07,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 229 transitions, 4220 flow [2022-12-13 20:55:07,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 229 transitions, 4128 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-13 20:55:07,655 INFO L231 Difference]: Finished difference. Result has 97 places, 91 transitions, 1408 flow [2022-12-13 20:55:07,655 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1333, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1408, PETRI_PLACES=97, PETRI_TRANSITIONS=91} [2022-12-13 20:55:07,655 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 64 predicate places. [2022-12-13 20:55:07,656 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 91 transitions, 1408 flow [2022-12-13 20:55:07,656 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 20:55:07,656 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:07,656 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 20:55:07,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 20:55:07,656 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:07,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1503722696, now seen corresponding path program 1 times [2022-12-13 20:55:07,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:07,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005944130] [2022-12-13 20:55:07,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:07,755 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 20:55:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:07,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005944130] [2022-12-13 20:55:07,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005944130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:07,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:07,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:55:07,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911742626] [2022-12-13 20:55:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:07,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:55:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:55:07,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:55:07,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2022-12-13 20:55:07,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 91 transitions, 1408 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 20:55:07,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:07,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2022-12-13 20:55:07,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:07,977 INFO L130 PetriNetUnfolder]: 432/730 cut-off events. [2022-12-13 20:55:07,977 INFO L131 PetriNetUnfolder]: For 13452/13588 co-relation queries the response was YES. [2022-12-13 20:55:07,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5941 conditions, 730 events. 432/730 cut-off events. For 13452/13588 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3317 event pairs, 33 based on Foata normal form. 83/803 useless extension candidates. Maximal degree in co-relation 5888. Up to 339 conditions per place. [2022-12-13 20:55:07,981 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 114 selfloop transitions, 13 changer transitions 80/224 dead transitions. [2022-12-13 20:55:07,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 224 transitions, 4114 flow [2022-12-13 20:55:07,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:55:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 20:55:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 931 transitions. [2022-12-13 20:55:07,983 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47890946502057613 [2022-12-13 20:55:07,983 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 931 transitions. [2022-12-13 20:55:07,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 931 transitions. [2022-12-13 20:55:07,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:07,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 931 transitions. [2022-12-13 20:55:07,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.44444444444444) internal successors, (931), 9 states have internal predecessors, (931), 0 states have call successors, (0), 0 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 20:55:07,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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 20:55:07,986 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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 20:55:07,986 INFO L175 Difference]: Start difference. First operand has 97 places, 91 transitions, 1408 flow. Second operand 9 states and 931 transitions. [2022-12-13 20:55:07,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 224 transitions, 4114 flow [2022-12-13 20:55:08,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 224 transitions, 3958 flow, removed 52 selfloop flow, removed 7 redundant places. [2022-12-13 20:55:08,002 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 1320 flow [2022-12-13 20:55:08,003 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1320, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2022-12-13 20:55:08,003 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 67 predicate places. [2022-12-13 20:55:08,003 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 1320 flow [2022-12-13 20:55:08,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 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 20:55:08,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:08,003 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:08,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 20:55:08,003 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1657513784, now seen corresponding path program 1 times [2022-12-13 20:55:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:08,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230268705] [2022-12-13 20:55:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:08,444 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 20:55:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230268705] [2022-12-13 20:55:08,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230268705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:08,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:08,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:55:08,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371042127] [2022-12-13 20:55:08,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:08,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:55:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:55:08,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:55:08,488 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 216 [2022-12-13 20:55:08,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 1320 flow. Second operand has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 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 20:55:08,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:08,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 216 [2022-12-13 20:55:08,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:08,858 INFO L130 PetriNetUnfolder]: 571/1032 cut-off events. [2022-12-13 20:55:08,858 INFO L131 PetriNetUnfolder]: For 13977/14027 co-relation queries the response was YES. [2022-12-13 20:55:08,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8260 conditions, 1032 events. 571/1032 cut-off events. For 13977/14027 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5259 event pairs, 50 based on Foata normal form. 44/1071 useless extension candidates. Maximal degree in co-relation 8208. Up to 472 conditions per place. [2022-12-13 20:55:08,863 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 79 selfloop transitions, 45 changer transitions 24/156 dead transitions. [2022-12-13 20:55:08,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 2339 flow [2022-12-13 20:55:08,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 20:55:08,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 20:55:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 929 transitions. [2022-12-13 20:55:08,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47788065843621397 [2022-12-13 20:55:08,865 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 929 transitions. [2022-12-13 20:55:08,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 929 transitions. [2022-12-13 20:55:08,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:08,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 929 transitions. [2022-12-13 20:55:08,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.22222222222223) internal successors, (929), 9 states have internal predecessors, (929), 0 states have call successors, (0), 0 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 20:55:08,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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 20:55:08,868 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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 20:55:08,868 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 1320 flow. Second operand 9 states and 929 transitions. [2022-12-13 20:55:08,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 156 transitions, 2339 flow [2022-12-13 20:55:08,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 156 transitions, 2110 flow, removed 52 selfloop flow, removed 9 redundant places. [2022-12-13 20:55:08,891 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 1358 flow [2022-12-13 20:55:08,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1358, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2022-12-13 20:55:08,891 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2022-12-13 20:55:08,892 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 1358 flow [2022-12-13 20:55:08,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 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 20:55:08,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:08,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:08,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 20:55:08,892 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1524634002, now seen corresponding path program 2 times [2022-12-13 20:55:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:08,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072357663] [2022-12-13 20:55:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:55:09,487 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 20:55:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:55:09,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072357663] [2022-12-13 20:55:09,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072357663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:55:09,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:55:09,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:55:09,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068112483] [2022-12-13 20:55:09,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:55:09,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:55:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:55:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:55:09,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:55:09,522 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 216 [2022-12-13 20:55:09,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 1358 flow. Second operand has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 20:55:09,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:55:09,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 216 [2022-12-13 20:55:09,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:55:09,782 INFO L130 PetriNetUnfolder]: 613/1120 cut-off events. [2022-12-13 20:55:09,782 INFO L131 PetriNetUnfolder]: For 13382/13383 co-relation queries the response was YES. [2022-12-13 20:55:09,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8257 conditions, 1120 events. 613/1120 cut-off events. For 13382/13383 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5831 event pairs, 83 based on Foata normal form. 1/1120 useless extension candidates. Maximal degree in co-relation 8222. Up to 489 conditions per place. [2022-12-13 20:55:09,786 INFO L137 encePairwiseOnDemand]: 207/216 looper letters, 86 selfloop transitions, 36 changer transitions 25/149 dead transitions. [2022-12-13 20:55:09,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 2214 flow [2022-12-13 20:55:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:55:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 20:55:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2022-12-13 20:55:09,789 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4695767195767196 [2022-12-13 20:55:09,789 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2022-12-13 20:55:09,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2022-12-13 20:55:09,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:55:09,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2022-12-13 20:55:09,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 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 20:55:09,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 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 20:55:09,792 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 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 20:55:09,792 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 1358 flow. Second operand 7 states and 710 transitions. [2022-12-13 20:55:09,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 2214 flow [2022-12-13 20:55:09,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 149 transitions, 2100 flow, removed 48 selfloop flow, removed 4 redundant places. [2022-12-13 20:55:09,816 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 1464 flow [2022-12-13 20:55:09,816 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1464, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2022-12-13 20:55:09,816 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 70 predicate places. [2022-12-13 20:55:09,816 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 1464 flow [2022-12-13 20:55:09,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 20:55:09,816 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:55:09,817 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:09,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 20:55:09,817 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 20:55:09,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:55:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash -290274356, now seen corresponding path program 3 times [2022-12-13 20:55:09,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:55:09,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891522314] [2022-12-13 20:55:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:55:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:55:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:55:09,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:55:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:55:09,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:55:09,896 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:55:09,897 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 20:55:09,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 20:55:09,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 20:55:09,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 20:55:09,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 20:55:09,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 20:55:09,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 20:55:09,900 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:55:09,904 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 20:55:09,904 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:55:09,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:55:09 BasicIcfg [2022-12-13 20:55:09,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:55:09,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:55:09,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:55:09,955 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:55:09,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:54:53" (3/4) ... [2022-12-13 20:55:09,958 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:55:10,012 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:55:10,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:55:10,013 INFO L158 Benchmark]: Toolchain (without parser) took 17960.95ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 116.7MB in the beginning and 169.8MB in the end (delta: -53.1MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. [2022-12-13 20:55:10,013 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:55:10,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.96ms. Allocated memory is still 151.0MB. Free memory was 116.2MB in the beginning and 90.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 20:55:10,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.07ms. Allocated memory is still 151.0MB. Free memory was 90.1MB in the beginning and 87.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 20:55:10,013 INFO L158 Benchmark]: Boogie Preprocessor took 27.31ms. Allocated memory is still 151.0MB. Free memory was 87.3MB in the beginning and 85.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:55:10,014 INFO L158 Benchmark]: RCFGBuilder took 518.99ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 85.7MB in the beginning and 146.5MB in the end (delta: -60.9MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2022-12-13 20:55:10,014 INFO L158 Benchmark]: TraceAbstraction took 16944.82ms. Allocated memory was 182.5MB in the beginning and 318.8MB in the end (delta: 136.3MB). Free memory was 145.5MB in the beginning and 179.2MB in the end (delta: -33.7MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. [2022-12-13 20:55:10,014 INFO L158 Benchmark]: Witness Printer took 57.17ms. Allocated memory is still 318.8MB. Free memory was 179.2MB in the beginning and 169.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:55:10,015 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.96ms. Allocated memory is still 151.0MB. Free memory was 116.2MB in the beginning and 90.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.07ms. Allocated memory is still 151.0MB. Free memory was 90.1MB in the beginning and 87.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.31ms. Allocated memory is still 151.0MB. Free memory was 87.3MB in the beginning and 85.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 518.99ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 85.7MB in the beginning and 146.5MB in the end (delta: -60.9MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16944.82ms. Allocated memory was 182.5MB in the beginning and 318.8MB in the end (delta: 136.3MB). Free memory was 145.5MB in the beginning and 179.2MB in the end (delta: -33.7MB). Peak memory consumption was 101.8MB. Max. memory is 16.1GB. * Witness Printer took 57.17ms. Allocated memory is still 318.8MB. Free memory was 179.2MB in the beginning and 169.8MB in the end (delta: 9.4MB). 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: 3.4s, 119 PlacesBefore, 33 PlacesAfterwards, 111 TransitionsBefore, 23 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 5227 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2501, independent: 2342, independent conditional: 0, independent unconditional: 2342, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1180, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2501, independent: 1203, independent conditional: 0, independent unconditional: 1203, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1180, unknown conditional: 0, unknown unconditional: 1180] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-1, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=1, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_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=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: 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: 16.8s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 907 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 708 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2015 IncrementalHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 104 mSDtfsCounter, 2015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2138occurred in iteration=15, InterpolantAutomatonStates: 105, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 2892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 20:55:10,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d99b53a-efab-4171-9a2f-c50a59a6ace8/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